A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
From MaRDI portal
Publication:1771210
DOI10.1023/B:HEUR.0000045323.83583.bdzbMath1062.90009MaRDI QIDQ1771210
Teodor Gabriel Crainic, Geneviéve Hernu, Bernard Gendron
Publication date: 7 April 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, A capacity scaling heuristic for the multicommodity capacitated network design problem, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, A cutting plane algorithm for the capacitated connected facility location problem, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, A Benders decomposition-based approach for logistics service network design, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Minimum‐cost flow problems having arc‐activation costs, Benders, metric and cutset inequalities for multicommodity capacitated network design, Service network design models for two-tier city logistics, Accelerating benders decomposition with heuristicmaster problem solutions, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, A first multilevel cooperative algorithm for capacitated multicommodity network design, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, 0-1 reformulations of the multicommodity capacitated network design problem, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Progressive hedging-based metaheuristics for stochastic network design, A local branching heuristic for the capacitated fixed-charge network design problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, COLE: a new heuristic approach for fixed charge problem computational results, Scheduled Service Network Design for Freight Rail Transportation
