New exact techniques applied to a class of network flow formulations
From MaRDI portal
Publication:2061874
DOI10.1007/978-3-030-73879-2_13zbMath1482.90228OpenAlexW3163972290MaRDI QIDQ2061874
Manuel Iori, Flávio K. Miyazawa, Vinícius Loti de Lima
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-73879-2_13
Related Items
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, Exact solution of network flow models with strong relaxations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Branching in branch-and-price: A generic scheme
- On compact formulations for integer programs solved by column generation
- Lagrangian bounds from decision diagrams
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- A dynamic programming approach for consistency and propagation for knapsack constraints
- A first look at picking dual variables for maximizing reduced cost fixing
- A generic exact solver for vehicle routing and related problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Friendly bin packing instances without integer round-up property
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Column Generation
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Principles and Practice of Constraint Programming – CP 2004
