A polyhedral study of the cardinality constrained knapsack problem
From MaRDI portal
Publication:1404231
DOI10.1007/s10107-003-0420-8zbMath1023.90085MaRDI QIDQ1404231
Ismael Regis jun. de Farias, Nemhauser, George I.
Publication date: 20 August 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0420-8
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Optimal rank-sparsity decomposition, Integer-programming software systems, Knapsack polytopes: a survey, Branch-and-cut for linear programs with overlapping SOS1 constraints, A polyhedral study of nonconvex quadratic programs with box constraints, Optimization algorithms for the disjunctively constrained knapsack problem, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Convex optimization under combinatorial sparsity constraints, Subset selection for multiple linear regression via optimization, Semi-continuous network flow problems, A family of inequalities valid for the robust single machine scheduling polyhedron, On the structure of linear programs with overlapping cardinality constraints, On cutting planes for cardinality-constrained linear programs, A polyhedral study of the semi-continuous knapsack problem
Uses Software
