On compact formulations for integer programs solved by column generation
From MaRDI portal
Recommendations
- Column-Generation in Integer Linear Programming
- Enhancing CP-based column generation for integer programs
- A technical review of column generation in integer programming
- scientific article; zbMATH DE number 5863207
- An integer optimality condition for column generation on zero-one linear programs
- An integer programming column generation principle for heuristic search methods
- Generalized column generation for linear programming
- scientific article; zbMATH DE number 679864
- Compact representation of near-optimal integer programming solutions
- Column generation in the integral simplex method
Cites work
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 680242 (Why is no real title available?)
- scientific article; zbMATH DE number 1086903 (Why is no real title available?)
- scientific article; zbMATH DE number 1462943 (Why is no real title available?)
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- 2-path cuts for the vehicle routing problem with time windows
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Column Generation Approach for Graph Coloring
- A Linear Programming Approach to the Cutting-Stock Problem
- A Method of Decomposition for Integer Programs
- A unified approach for price directive decomposition procedures in integer programming
- An exact algorithm for IP column generation
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Branch-and-price: Column generation for solving huge integer programs
- Decomposition Principle for Linear Programs
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- LP models for bin packing and cutting stock problems
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Parallel machine scheduling by column generation
- Routing with time windows by column generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- The preferential bidding system at Air Canada
- The shortest path problem with forbidden paths
Cited in
(19)- An integer programming column generation principle for heuristic search methods
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Cutting planes for branch-and-price algorithms
- A stabilized structured Dantzig-Wolfe decomposition method
- Enabling research through the SCIP Optimization Suite 8.0
- Branching in branch-and-price: A generic scheme
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Column generation for extended formulations
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- New exact techniques applied to a class of network flow formulations
- Column generation for extended formulations
- Deriving compact extended formulations via LP-based separation techniques
- Branch-and-price: Column generation for solving huge integer programs
- scientific article; zbMATH DE number 5863207 (Why is no real title available?)
- A technical review of column generation in integer programming
- From High-Level Model to Branch-and-Price Solution in G12
- Exact solution of network flow models with strong relaxations
This page was built for publication: On compact formulations for integer programs solved by column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817199)