Kurt Jørnsten - Citegraph

Author Info

Name	Affiliation	Papers
KURT JØRNSTEN	Univ Bergen, Dept Informat, N-5020 Bergen, Norway	26
Collaborators	Citations	PageRank
36	232	24.52
Referers	Referees	References
478	352	199

Search Limit

100478

Publications (26 rows)

Collaborators (36 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Modeling Commuting Flows via Fixed Components	0	0.34	2020
Cooperation of customers in traveling salesman problems with profits	0	0.34	2020
Incitements for transportation collaboration by cost allocation	0	0.34	2019
Critical objective function values in linear sum assignment problems.	0	0.34	2018
The Stable Tournament Problem: Matching sports schedules with preferences.	0	0.34	2017
Statistical testing of bounded rationality with applications to the newsvendor model.	1	0.35	2017
An improved Lagrangian relaxation and dual ascent approach to facility location problems	2	0.37	2016
Pricing combinatorial auctions by a set of linear price vectors	0	0.34	2016
A pricing scheme for combinatorial auctions based on bundle sizes	2	0.38	2016
Constructive and blocking power in collaborative transportation	10	0.52	2016
Common mistakes in computing the nucleolus.	7	0.48	2015
Searching For Optimal Integer Solutions To Set Partitioning Problems Using Column Generation	1	0.36	2014
A maximum entropy approach to the newsvendor problem with partial information.	22	0.80	2013
Semi-Lagrangean approach for price discovery in markets with non-convexities.	5	0.63	2011
Flow sharing and bankruptcy games	4	0.48	2010
Cost allocation in collaborative forest transportation	63	2.75	2010
Lower and upper bounds for linear production games	1	0.36	2009
Non-linear anonymous pricing combinatorial auctions	4	0.56	2009
Equilibrium prices supported by dual price functions in markets with non-convexities	12	1.25	2008
Optimal Solutions in the Multi-location Inventory System with Transshipments	7	0.67	2007
The Deregulated Electricity Market Viewed as a Bilevel Programming Problem	5	0.85	2005
Convergence aspects of adaptive clustering in variable aggregation	3	0.62	1999
On bicriterion minimal spanning trees: an approximation	17	0.87	1996
On the nucleolus of the basic vehicle routing game	35	4.96	1996
Partial cover and complete cover inequalities	2	0.41	1994
Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic	29	4.81	1994