A generalization of column generation to accelerate convergence
type: Item
instance of: scholarly article
title: A generalization of column generation to accelerate convergence
zbMATH Open document ID: 1184.90102
author: Dong Liang
author: Wilbert E. Wilhelm
published in: Mathematical Programming. Series A. Series B
publication date: 2010-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 5673367
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: Multi-commodity network flow
zbMATH Keywords: Cutting stock problem
zbMATH Keywords: Production-assembly-distribution system design
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10107-008-0251-8
OpenAlex ID: W2054085723
cites work: An extended model and a column generation algorithm for the planar multicommodity flow problem
cites work: Q4363157
cites work: Q3160276
cites work: On the choice of explicit stabilizing terms in column generation
cites work: Cutting Stock Problems
cites work: Dual-Optimal Inequalities for Stabilized Column Generation
cites work: Decomposition Principle for Linear Programs
cites work: Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
cites work: Column Generation
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Selected Topics in Column Generation
cites work: Routing with time windows by column generation
cites work: Generalized Bundle Methods
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Multicommodity network flows: The impact of formulation on decomposition
cites work: Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
cites work: Q4040221
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: Using extra dual cuts to accelerate column generation
cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming
cites work: Implementing Mixed Integer Column Generation
cites work: A technical review of column generation in integer programming
DOI: 10.1007/S10107-008-0251-8
description: scientific article; zbMATH DE number 5673367