Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712474
DOI10.1007/b97946zbMath1092.90515OpenAlexW2484779063MaRDI QIDQ5712474
Andreas S. Schulz, José R. Correa, Nicolás E. Stier-Moses
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ Atomic routing games on maximum congestion ⋮ On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands ⋮ A new model for selfish routing ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ On the efficiency of equilibria in mean-field oscillator games