A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
From MaRDI portal
Publication:342561
DOI10.1016/j.cor.2016.06.016zbMath1349.90165arXiv1504.03217MaRDI QIDQ342561
Edcarllos Santos, Luidi Simonetti, Pedro Henrique González, Carlos A. Martinhon, Philippe Yves Paul Michelon
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.03217
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem, On two new formulations for the fixed charge network design problem with shortest path constraints, A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Uses Software
Cites Work
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Bilevel programming: a survey
- Local branching
- Solving the hazmat transport network design problem
- TTT plots: a perl program to create time-to-target plots
- On the Hazmat Transport Network Design Problem
- Worst-Case Analysis of Network Design Problem Heuristics
- The complexity of the network design problem
- Optimization of Internet Protocol network design and routing
- Unnamed Item
- Unnamed Item