A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow

DOI10.1016/j.cor.2016.06.016zbMath1349.90165arXiv1504.03217OpenAlexW2952774731MaRDI 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

zbMATH Keywords

heuristicsnetwork designlocal branchingbilevel problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection, 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, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• PERL
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• 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