New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
From MaRDI portal
Publication:2669599
DOI10.1016/j.cor.2021.105505OpenAlexW3189086543MaRDI QIDQ2669599
Pierre Le Bodic, Andreas T. Ernst, Ahmad Kazemi, Mohan Krishnamoorthy
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.03707
Cites Work
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Aggregation error for location models: Survey and analysis
- A local branching heuristic for the capacitated fixed-charge network design problem
- Minimum cost capacity installation for multicommodity network flows
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- An aggregate and iterative disaggregate algorithm with proven optimality in machine learning
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A survey on Benders decomposition applied to fixed-charge network design problems
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Computational experience with a difficult mixed-integer multicommodity flow problem
- Locomotive fuel management with inline refueling
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A time-space network based exact optimization model for multi-depot bus scheduling
- Metric inequalities and the network loading problem
- On cut-based inequalities for capacitated network design polyhedra
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Multicommodity network design with discrete node costs
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Bounds for Row-Aggregation in Linear Programming
- Finding the K Shortest Loopless Paths in a Network
- Capacitated Network Design—Polyhedral Structure and Computation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Benchmarking optimization software with performance profiles.
This page was built for publication: New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
