MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
From MaRDI portal
Publication:5149549
DOI10.1142/S0217595920500098zbMath1457.90028OpenAlexW2995443620MaRDI QIDQ5149549
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920500098
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for network design problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Local branching
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A General Heuristic for Production Planning Problems
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
- On cut-based inequalities for capacitated network design polyhedra
- A Linear Programming Approach to the Cutting-Stock Problem
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- Capacitated Network Design—Polyhedral Structure and Computation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
