Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
From MaRDI portal
Publication:5131729
DOI10.1287/ijoc.2017.0784OpenAlexW2625859466MaRDI QIDQ5131729
Artur Alves Pessoa, Ruslan Sadykov, François Vanderbeck, Eduardo Uchoa
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01077984v4/file/stabPap3thR5.pdf
Related Items
Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Column elimination for capacitated vehicle routing problems ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks ⋮ Bin Packing Problem with Time Lags ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ A generic exact solver for vehicle routing and related problems ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Conference scheduling: a clustering-based approach ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ Solving bin packing problems using VRPSolver models ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ A lexicographic pricer for the fractional bin packing problem ⋮ Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem ⋮ The minimum mean cycle-canceling algorithm for linear programs ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Chebyshev center based column generation
- A \texttt{cost-regular} based hybrid column generation approach
- Proximity control in bundle methods for convex nondifferentiable minimization
- On the choice of explicit stabilizing terms in column generation
- Stabilized column generation
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- The volume algorithm: Producing primal solutions with a subgradient method
- New variants of bundle methods
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- New developments in the primal-dual column generation technique
- Comparison of bundle and classical column generation
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A path relinking approach with ejection chains for the generalized assignment problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Improved Primal Simplex Algorithm for Degenerate Linear Programs
- Level bundle methods for oracles with on-demand accuracy
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An In-Out Approach to Disjunctive Optimization
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- A Minimal Algorithm for the 0-1 Knapsack Problem
- On constrained optimization by adjoint based quasi-Newton methods
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Implementing Mixed Integer Column Generation
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
