Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
type: Item
instance of: scholarly article
title: Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
zbMATH Open document ID: 1506.90172
author: Marco E. Lübbecke
author: Stephen J. Maher
author: Jonas T. Witt
published in: Discrete Optimization
publication date: 2021-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7336086
zbMATH Keywords: Benders decomposition
zbMATH Keywords: Dantzig-Wolfe reformulation
zbMATH Keywords: domain reduction
zbMATH Keywords: column generation
describes a project that uses: SCIP
describes a project that uses: GCG
describes a project that uses: ISUD
MaRDI profile type: Publication
full work available at URL: j.disopt.2021.100626
OpenAlex ID: W3126837002
cites work: Q4040221
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Selected Topics in Column Generation
cites work: Q4310695
cites work: Q4735035
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
cites work: Path-reduced costs for eliminating arcs in routing and scheduling
cites work: Cost based filtering for the constrained knapsack problem
cites work: Constraint programming based column generation for crew assignment
cites work: A Primer in Column Generation
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: An integer optimality condition for column generation on zero-one linear programs
cites work: Column generation in the integral simplex method
cites work: Integral simplex using decomposition for the set partitioning problem
cites work: SCIP: solving constraint integer programs
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
cites work: A horizon decomposition approach for the capacitated lot-sizing problem with setup times
DOI: 10.1016/J.DISOPT.2021.100626
description: scientific article; zbMATH DE number 7336086