Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
From MaRDI portal
Publication:2655613
DOI10.1016/j.ejor.2009.11.014zbMath1178.90252OpenAlexW2042396778MaRDI QIDQ2655613
Publication date: 25 January 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.11.014
Related Items (4)
A branch-price-and-cut algorithm for the workover rig routing problem ⋮ Adapting the \textit{ng}-path relaxation for bike balancing problems ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
Cites Work
- Unnamed Item
- Branching in branch-and-price: A generic scheme
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Cliques and clustering: A combinatorial approach
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Min-cut clustering
- Solving binary cutting stock problems by column generation and branch- and-bound
- An exact algorithm for IP column generation
- The simple plant location problem: Survey and synthesis
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Vehicle routing problem with elementary shortest path based column generation
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Dynamic Version of the Economic Lot Size Model
- Parallel Machine Scheduling by Column Generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Lot-Sizing with Start-Up Times
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- Decomposition Principle for Linear Programs
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A Column Generation Approach for Graph Coloring
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Selected Topics in Column Generation
- Vehicle Routing Problem with Time Windows
This page was built for publication: Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
