Solving network design problems via iterative aggregation
From MaRDI portal
Publication:2516352
Recommendations
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure
- Solving the capacitated local access network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
Cites work
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A note on the selection of Benders' cuts
- A survey on Benders decomposition applied to fixed-charge network design problems
- Aggregation and Disaggregation in Integer Programming Problems
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Aggregation in large-scale optimization
- Aggregation of equations in integer programming
- An LP-aggregation view on aggregation in multi-level production planning
- Benchmarking optimization software with performance profiles.
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- scientific article; zbMATH DE number 4023107 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- Improving bounds on the football pool problem by integer programming and high-throughput computing
- Logic-based Benders decomposition
- Partitioning procedures for solving mixed-variables programming problems
- Solution of Large-Scale Transportation Problems Through Aggregation
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Some relationships between lagrangian and surrogate duality in integer programming
- Statistical mechanics of complex networks
- The complexity of the network design problem
- Using aggregation to optimize long-term production planning at an underground mine
Cited in
(9)- On iterative solutions for performance of high-speed switching networks
- 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
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Branch-and-refine for solving time-expanded MILP formulations
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Optimization for L1-Norm Error Fitting via Data Aggregation
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
- A novel Pareto-optimal cut selection strategy for Benders decomposition
This page was built for publication: Solving network design problems via iterative aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2516352)
