Cardinality Constrained Decomposition

DOI10.1080/02522667.1990.10699034zbMATH Open0713.90048OpenAlexW2070503271MaRDI QIDQ3199189FDOQ3199189

Authors: Søren Holm, Kurt Jörnsten 

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699034

Recommendations

• Column generation decomposition with the degenerate constraints in the subproblem
• On cutting planes for cardinality-constrained linear programs
• On a cardinality constrained linear programming knapsack problem
• Cardinality and the Simplex Tableau for the Set Partitioning Problem
• Convergent inexact penalty decomposition methods for cardinality-constrained problems

zbMATH Keywords

column generationcardinality constraintsdecomposition scheme

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Decomposition methods (49M27)

Cites Work

• Title not available (Why is that?)
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm

Cited In (2)

• Cardinality and the Simplex Tableau for the Set Partitioning Problem
• Combination of Among and Cardinality Constraints

This page was built for publication: Cardinality Constrained Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199189)