default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKurt Jörnsten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j32]Ondrej Osicka
, Mario Guajardo, Kurt Jörnsten:
Cooperation of customers in traveling salesman problems with profits. Optim. Lett. 14(5): 1219-1233 (2020)- [j31]Sahar Babri, Kurt Jörnsten, Inge Thorsen, Jan Ubøe:
Modeling Commuting Flows via Fixed Components. Transp. Sci. 54(5): 1225-1237 (2020)
2010 – 2019
- 2019
- [j30]Joen Dahlberg, Stefan Engevall, Maud Göthe-Lundgren, Kurt Jörnsten, Mikael Rönnqvist:
Incitements for transportation collaboration by cost allocation. Central Eur. J. Oper. Res. 27(4): 1009-1032 (2019) - 2018
- [j29]Ivan Belik, Kurt Jörnsten:
Critical objective function values in linear sum assignment problems. J. Comb. Optim. 35(3): 842-852 (2018) - 2017
- [j28]Jan Ubøe, Jonas Andersson, Kurt Jörnsten, Jostein Lillestøl, Leif Sandal:
Statistical testing of bounded rationality with applications to the newsvendor model. Eur. J. Oper. Res. 259(1): 251-261 (2017) - [j27]Mario Guajardo, Kurt Jörnsten:
The Stable Tournament Problem: Matching sports schedules with preferences. Oper. Res. Lett. 45(5): 461-466 (2017) - 2016
- [j26]Kurt Jörnsten, Andreas Klose:
An improved Lagrangian relaxation and dual ascent approach to facility location problems. Comput. Manag. Sci. 13(3): 317-348 (2016) - [j25]Dirk Briskorn, Kurt Jørnsten, Philipp Zeise:
A pricing scheme for combinatorial auctions based on bundle sizes. Comput. Oper. Res. 70: 9-17 (2016) - [j24]Mario Guajardo, Kurt Jörnsten, Mikael Rönnqvist:
Constructive and blocking power in collaborative transportation. OR Spectr. 38(1): 25-50 (2016) - [j23]Dirk Briskorn, Kurt Jørnsten, Jenny Nossack:
Pricing combinatorial auctions by a set of linear price vectors. OR Spectr. 38(4): 1043-1070 (2016) - 2015
- [j22]Mario Guajardo, Kurt Jörnsten:
Common mistakes in computing the nucleolus. Eur. J. Oper. Res. 241(3): 931-935 (2015) - 2014
- [j21]David Bredström, Kurt Jörnsten, Mikael Rönnqvist, Mathieu Bouchard:
Searching for optimal integer solutions to set partitioning problems using column generation. Int. Trans. Oper. Res. 21(2): 177-197 (2014) - 2013
- [j20]Jonas Andersson, Kurt Jörnsten, Sigrid Lise Nonås, Leif K. Sandal, Jan Ubøe:
A maximum entropy approach to the newsvendor problem with partial information. Eur. J. Oper. Res. 228(1): 190-200 (2013) - [c1]Georgios C. Chasparis, Anders Rantzer, Kurt Jørnsten:
A decomposition approach to multi-region optimal power flow in electricity networks. ECC 2013: 3018-3024 - 2011
- [j19]Veronica Araoz, Kurt Jörnsten:
Semi-Lagrangean approach for price discovery in markets with non-convexities. Eur. J. Oper. Res. 214(2): 411-417 (2011) - 2010
- [j18]Mikael Frisk, Maud Göthe-Lundgren, Kurt Jörnsten, Mikael Rönnqvist:
Cost allocation in collaborative forest transportation. Eur. J. Oper. Res. 205(2): 448-458 (2010) - [j17]Endre Bjørndal, Kurt Jörnsten:
Flow sharing and bankruptcy games. Int. J. Game Theory 39(1-2): 11-28 (2010)
2000 – 2009
- 2009
- [j16]Endre Bjørndal, Kurt Jörnsten:
Lower and upper bounds for linear production games. Eur. J. Oper. Res. 196(2): 476-486 (2009) - [j15]Andreas Drexl, Kurt Jørnsten, Diether Knof:
Non-linear anonymous pricing combinatorial auctions. Eur. J. Oper. Res. 199(1): 296-302 (2009) - 2008
- [j14]Mette Bjørndal, Kurt Jörnsten:
Equilibrium prices supported by dual price functions in markets with non-convexities. Eur. J. Oper. Res. 190(3): 768-789 (2008) - 2007
- [j13]Lars Magne Nonås, Kurt Jörnsten:
Optimal Solutions in the Multi-location Inventory System with Transshipments. J. Math. Model. Algorithms 6(1): 47-75 (2007) - [j12]Andreas Drexl, Kurt Jørnsten:
Reflections about pseudo-dual prices in combinatorial auctions. J. Oper. Res. Soc. 58(12): 1652-1659 (2007) - 2005
- [j11]Mette Bjørndal, Kurt Jørnsten:
The Deregulated Electricity Market Viewed as a Bilevel Programming Problem. J. Glob. Optim. 33(3): 465-475 (2005)
1990 – 1999
- 1999
- [j10]Kurt Jørnsten, Rainer Leisten, Sverre Storøy:
Convergence aspects of adaptive clustering in variable aggregation. Comput. Oper. Res. 26(10-11): 955-966 (1999) - 1997
- [j9]Marshall L. Fisher, Kurt O. Jörnsten, Oli B. G. Madsen:
Vehicle Routing with Time Windows: Two Optimization Algorithms. Oper. Res. 45(3): 488-492 (1997) - 1996
- [j8]Kim Allan Andersen, Kurt Jörnsten, Mikael Lind:
On bicriterion minimal spanning trees: An approximation. Comput. Oper. Res. 23(12): 1171-1182 (1996) - [j7]Maud Göthe-Lundgren, Kurt Jörnsten, Peter Värbrand:
On the nucleolus of the basic vehicle routing game. Math. Program. 72: 83-100 (1996) - 1994
- [j6]Ronny Aboudi, Kurt Jörnsten:
Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic. INFORMS J. Comput. 6(1): 82-93 (1994) - [j5]Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli:
Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24(1): 11-21 (1994) - [j4]Elena Fernández, Kurt Jørnsten:
Partial cover and complete cover inequalities. Oper. Res. Lett. 15(1): 19-33 (1994) - [j3]Geir Dahl, Kurt Jörnsten, G. Løvnes, S. Svaet:
Graph optimization problems in connection with the management of mobile communications systems. Telecommun. Syst. 3(3): 319-339 (1994) - 1993
- [j2]Kurt Jörnsten, Stein W. Wallace:
Overcoming the (Apparent) Problem of Inconsistency in Origin-Destination Matrix Estimations. Transp. Sci. 27(4): 374-380 (1993) - 1990
- [j1]Ronny Aboudi, Kurt Jørnsten:
Resource constrained assignment problems. Discret. Appl. Math. 26(2-3): 175-191 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
