Kurt Jörnsten

Orcid: 0000-0001-9370-5285

According to our database1, Kurt Jörnsten authored at least 33 papers between 1990 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Modeling Commuting Flows via Fixed Components.
Transp. Sci., 2020

Cooperation of customers in traveling salesman problems with profits.
Optim. Lett., 2020

2019
Incitements for transportation collaboration by cost allocation.
Central Eur. J. Oper. Res., 2019

2018
Critical objective function values in linear sum assignment problems.
J. Comb. Optim., 2018

2017
The Stable Tournament Problem: Matching sports schedules with preferences.
Oper. Res. Lett., 2017

Statistical testing of bounded rationality with applications to the newsvendor model.
Eur. J. Oper. Res., 2017

2016
Constructive and blocking power in collaborative transportation.
OR Spectr., 2016

Pricing combinatorial auctions by a set of linear price vectors.
OR Spectr., 2016

A pricing scheme for combinatorial auctions based on bundle sizes.
Comput. Oper. Res., 2016

An improved Lagrangian relaxation and dual ascent approach to facility location problems.
Comput. Manag. Sci., 2016

2015
Common mistakes in computing the nucleolus.
Eur. J. Oper. Res., 2015

2014
Searching for optimal integer solutions to set partitioning problems using column generation.
Int. Trans. Oper. Res., 2014

2013
A maximum entropy approach to the newsvendor problem with partial information.
Eur. J. Oper. Res., 2013

A decomposition approach to multi-region optimal power flow in electricity networks.
Proceedings of the 12th European Control Conference, 2013

2011
Semi-Lagrangean approach for price discovery in markets with non-convexities.
Eur. J. Oper. Res., 2011

2010
Flow sharing and bankruptcy games.
Int. J. Game Theory, 2010

Cost allocation in collaborative forest transportation.
Eur. J. Oper. Res., 2010

2009
Non-linear anonymous pricing combinatorial auctions.
Eur. J. Oper. Res., 2009

Lower and upper bounds for linear production games.
Eur. J. Oper. Res., 2009

2008
Equilibrium prices supported by dual price functions in markets with non-convexities.
Eur. J. Oper. Res., 2008

2007
Reflections about pseudo-dual prices in combinatorial auctions.
J. Oper. Res. Soc., 2007

Optimal Solutions in the Multi-location Inventory System with Transshipments.
J. Math. Model. Algorithms, 2007

2005
The Deregulated Electricity Market Viewed as a Bilevel Programming Problem.
J. Glob. Optim., 2005

1999
Convergence aspects of adaptive clustering in variable aggregation.
Comput. Oper. Res., 1999

1997
Vehicle Routing with Time Windows: Two Optimization Algorithms.
Oper. Res., 1997

1996
On the nucleolus of the basic vehicle routing game.
Math. Program., 1996

On bicriterion minimal spanning trees: An approximation.
Comput. Oper. Res., 1996

1994
Graph optimization problems in connection with the management of mobile communications systems.
Telecommun. Syst., 1994

Partial cover and complete cover inequalities.
Oper. Res. Lett., 1994

Weighted <i>k</i>-cardinality trees: Complexity and polyhedral structure.
Networks, 1994

Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic.
INFORMS J. Comput., 1994

1993
Overcoming the (Apparent) Problem of Inconsistency in Origin-Destination Matrix Estimations.
Transp. Sci., 1993

1990
Resource constrained assignment problems.
Discret. Appl. Math., 1990


  Loading...