Exact solution of network flow models with strong relaxations
From MaRDI portal
Publication:2689828
DOI10.1007/s10107-022-01785-9OpenAlexW3173086713MaRDI QIDQ2689828
Flávio K. Miyazawa, Manuel Iori, Vinícius Loti de Lima
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.14961
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Related Items (3)
The transportation problem with packing constraints ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integer linear programming models for the skiving stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Column generation for extended formulations
- Three enhancements for optimization-based bound tightening
- 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
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Local branching
- BPPLIB: a library for bin packing and cutting stock problems
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A first look at picking dual variables for maximizing reduced cost fixing
- New exact techniques applied to a class of network flow formulations
- 2DPackLib: a two-dimensional cutting and packing library
- A generic exact solver for vehicle routing and related problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Improved flow-based formulations for the skiving stock problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Friendly bin packing instances without integer round-up property
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
- 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
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- State-space relaxation procedures for the computation of bounds to routing problems
- 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
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Exact solution of network flow models with strong relaxations
