Using extra dual cuts to accelerate column generation
From MaRDI portal
Publication:2890465
DOI10.1287/IJOC.1030.0060zbMATH Open1239.90089OpenAlexW2127777220MaRDI QIDQ2890465FDOQ2890465
Authors: José Valério de Carvalho 
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0060
Recommendations
- A generalization of column generation to accelerate convergence
- Dual variable based fathoming in dynamic programs for column generation
- Cutting planes and column generation techniques with the projective algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- Column generation for minimizing total completion time in a parallel-batching environment
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Combining Column Generation and Lagrangian Relaxation
- Row and column generation technique for a multistage cutting stock problem
- scientific article; zbMATH DE number 5299948
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cited In (42)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Solving bin packing problems using VRPSolver models
- Exact solution techniques for two-dimensional cutting and packing
- Stabilizing branch-and-price for constrained tree problems
- Adding activities to the dual instead of cuts to the primal problem
- New stabilization procedures for the cutting stock problem
- Lower and upper bounds for the bin packing problem with fragile objects
- Exactly solving a two-level location problem with modular node capacities
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dual inequalities for stabilized column generation revisited
- A lexicographic pricer for the fractional bin packing problem
- An exact approach for the vertex coloring problem
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Stabilized branch-and-price algorithms for vector packing problems
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- A note on branch-and-cut-and-price
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Integrated charge batching and casting width selection at Baosteel
- Column generation for extended formulations
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- New developments in the primal-dual column generation technique
- Integer linear programming models for the skiving stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A generalization of column generation to accelerate convergence
- Exactly solving packing problems with fragmentation
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Exact algorithms for the bin packing problem with fragile objects
- Accelerating column generation for variable sized bin-packing problems
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Uses Software
This page was built for publication: Using extra dual cuts to accelerate column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890465)
