Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
DOI10.1016/j.ejor.2016.09.051zbMath1394.90477OpenAlexW2531214128MaRDI QIDQ1751662
Rita Macedo, François Clautiaux, Marie-Émilie Voge, Cláudio Alves, Saïd Hanafi
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01410170/file/two_ida.pdf
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (17)
Cites Work
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- A time-indexed LP-based approach for min-sum job-shop problems
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- LP models for bin packing and cutting stock problems
- Friendly bin packing instances without integer round-up property
- Solving network design problems via iterative aggregation
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- State-space relaxation procedures for the computation of bounds to routing problems
- `` Strong NP-Completeness Results
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Surrogate Constraints
This page was built for publication: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints