A dynamic discrete network design problem for maintenance planning in traffic networks

DOI10.1007/s10479-016-2171-yzbMath1380.90071OpenAlexW2308254628MaRDI QIDQ1695774

Pirmin Fontaine, Stefan Minner

Publication date: 8 February 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2171-y

zbMATH Keywords

bilevel programmingBenders decompositiondynamic discrete network design problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (6)

BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems ⋮ Integrating link-based discrete credit charging scheme into discrete network design problem ⋮ Benders decomposition for the Hazmat transport network design problem ⋮ Road network pricing and design for ordinary and hazmat vehicles: integrated model and specialized local search ⋮ Methodological Advances and New Formulations for Bilevel Network Design Problems ⋮ General transmission lemma and Wiener complexity of triangular grids

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for bi-level discrete network design problem
• Construction of a real-world bilevel linear programming model of the highway network design problem
• Hybrid meta-heuristic algorithms for solving network design problem
• Partitioning procedures for solving mixed-variables programming problems
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• A review of urban transportation network design problems
• An overview of bilevel optimization
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Computational Difficulties of Bilevel Linear Programming
• Bilevel Programming Problems

This page was built for publication: A dynamic discrete network design problem for maintenance planning in traffic networks