Cutting planes for branch-and-price algorithms
From MaRDI portal
Publication:3113514
DOI10.1002/net.20471zbMath1231.90296OpenAlexW2310466945MaRDI QIDQ3113514
Guy Desaulniers, Simon Spoorendonk, Jacques Desrosiers
Publication date: 18 January 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20471
Related Items (19)
Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ The pickup and delivery problem with time windows and handling operations ⋮ A branch-price-and-cut algorithm for the workover rig routing problem ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ A tutorial on column generation and branch-and-price for vehicle routing problems ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ Row-reduced column generation for degenerate master problems
Cites Work
- On compact formulations for integer programs solved by column generation
- An exact solution framework for a broad class of vehicle routing problems
- On the choice of explicit stabilizing terms in column generation
- A polyhedral approach to edge coloring
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Recovering an optimal LP basis from an optimal dual solution
- Resource extension functions: properties, inversion, and generalization to segments
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Routing with time windows by column generation
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
This page was built for publication: Cutting planes for branch-and-price algorithms
