On two new formulations for the fixed charge network design problem with shortest path constraints

DOI10.1016/j.cor.2019.04.007zbMath1458.90164OpenAlexW2915893890MaRDI QIDQ2003438

Ikram Bouras, Michael Poss, Fen Zhou, Rosa M. V. Figueiredo

Publication date: 8 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.007

zbMATH Keywords

cutting planenetwork designbranch-and-cutbi-level programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach

Cites Work

• Unnamed Item
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
• Designing a road network for hazardous materials shipments
• A cutting plane approach for bilevel hazardous material transport network design
• Solving the hazmat transport network design problem
• On the Hazmat Transport Network Design Problem
• Bilevel Programming Problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: On two new formulations for the fixed charge network design problem with shortest path constraints