Refined cut selection for Benders decomposition: applied to network capacity expansion problems
type: Item
instance of: scholarly article
title: Refined cut selection for Benders decomposition: applied to network capacity expansion problems
zbMATH Open document ID: 1485.90064
author: René Brandenberg
author: Paul Stursberg
published in: Mathematical Methods of Operations Research
publication date: 2022-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7472337
zbMATH Keywords: Benders decomposition
zbMATH Keywords: decomposition methods
zbMATH Keywords: cutting planes
zbMATH Keywords: reverse polar set
zbMATH Keywords: alternative polyhedron
zbMATH Keywords: Pareto optimal cuts
zbMATH Keywords: facet defining cuts
MaRDI profile type: Publication
full work available at URL: s00186-021-00756-8
OpenAlex ID: W3211811167
cites work: Facets of the knapsack polytope
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: On the Generalized Transportation Problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: ``Facet'' separation with one linear program
cites work: Q4371290
cites work: A convex-analysis perspective on disjunctive cuts
cites work: A note on the selection of Benders' cuts
cites work: Identifying Minimally Infeasible Subsystems of Inequalities
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Q4040221
cites work: Practical enhancements to the Magnanti-Wong method
cites work: The Benders decomposition algorithm: a literature review
cites work: Convex Analysis
cites work: On generating maximal nondominated Benders cuts
cites work: 50 Years of Integer Programming 1958-2008
DOI: 10.1007/S00186-021-00756-8
description: scientific article; zbMATH DE number 7472337