On compact formulations for integer programs solved by column generation
type: Item
instance of: scholarly article
title: On compact formulations for integer programs solved by column generation
zbMATH Open document ID: 1091.90052
author: Daniel Villeneuve
author: Jacques Desrosiers
author: Marco E. Lübbecke
author: François Soumis
published in: Annals of Operations Research
publication date: 2006-03-07T00:00:00Z
full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15493
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5009778
zbMATH Keywords: integer programming
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
OpenAlex ID: W2120018445
cites work: Q4363157
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: Decomposition Principle for Linear Programs
cites work: Q4955266
cites work: Q3783827
cites work: Q5687193
cites work: Routing with time windows by column generation
cites work: The preferential bidding system at Air Canada
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A unified approach for price directive decomposition procedures in integer programming
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: Q4487087
cites work: A Column Generation Approach for Graph Coloring
cites work: Q4040221
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: Q3818127
cites work: Q4310695
cites work: A Method of Decomposition for Integer Programs
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: Parallel machine scheduling by column generation
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: An exact algorithm for IP column generation
cites work: The shortest path problem with forbidden paths
DOI: 10.1007/S10479-005-3455-9
Recommended article: Column-Generation in Integer Linear Programming
Recommended article: Enhancing CP-based column generation for integer programs
Recommended article: A technical review of column generation in integer programming
Recommended article: Q3081840
Recommended article: An integer optimality condition for column generation on zero-one linear programs
Recommended article: An integer programming column generation principle for heuristic search methods
Recommended article: Generalized Column Generation for Linear Programming
Recommended article: Q4311911
Recommended article: Compact representation of near-optimal integer programming solutions
Recommended article: Column generation in the integral simplex method
description: scientific article; zbMATH DE number 5009778