scientific article; zbMATH DE number 2086929

MaRDI QIDQ4737534zbMATH OpenFDO

Authors G. L. Nemhauser, I. R. jun. de Farias

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370291.htm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• A polyhedral study of the cardinality constrained knapsack problem
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints

Cited in

(8)

• Implicit cover inequalities
• A polyhedral study of the cardinality constrained knapsack problem
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
• Polyhedral results for a class of cardinality constrained submodular minimization problems
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
• scientific article; zbMATH DE number 7366679 (Why is no real title available?)
• On a cardinality constrained linear programming knapsack problem
• A polyhedral study of the semi-continuous knapsack problem

This page was built for publication:

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