On generalizations of the parking permit problem and network leasing problems

DOI10.1016/J.ENDM.2017.10.039MaRDI QIDQ2413177zbMATH OpenOpenAlexFDO

Authors Murilo S. de Lima, Mário César San Felice, Orlando Lee

Publication date 9 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2017.10.039

zbMATH Keywords

approximation algorithmsbuy-at-bulk network designcompetitive online algorithmsleasing optimizationSteiner network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Generalizations of the parking problem
• scientific article; zbMATH DE number 524378
• Generalization of the selfish parking problem
• Parking capacity and pricing in park'n ride trips: A continuous equilibrium network design problem
• Generalized parking problems for levy processes
• Per-site occupancy in the discrete parking problem
• On the optimal parking problem
• A note on the optimal stopping parking problem
• Rényi's parking problem revisited

Cites work

• A factor 2 approximation algorithm for the generalized Steiner network problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Infrastructure Leasing Problems
• Offline and online facility leasing
• Online network design algorithms via hierarchical decompositions
• Rent, lease, or buy: randomized algorithms for multislope ski rental
• Towards Flexible Demands in Online Leasing Problems

Cited in

(3)

• Offline and online facility leasing
• Competitively pricing parking in a tree
• Offline and Online Facility Leasing

This page was built for publication: On generalizations of the parking permit problem and network leasing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413177)