Publication:4437514
From MaRDI portal
zbMath1032.90529MaRDI QIDQ4437514
Konrad Schlude, David Scot Taylor, Paolo Penna, Peter Widmayer, Evangelos Kranakis
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530264.htm
90C60: Abstract computational complexity for mathematical programming problems
90B85: Continuous location
90C39: Dynamic programming
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Practical algorithms for MSO model-checking on tree-decomposable graphs, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, Locating stops along bus or railway lines -- a bicriteria problem, Stop location design in public transportation networks: covering and accessibility objectives, To stop or not to stop: a time-constrained trip covering location problem on a tree network