Facets of the Complementarity Knapsack Polytope

DOI10.1287/MOOR.27.1.210.335MaRDI QIDQ5704071zbMATH OpenOpenAlexFDO

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

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.27.1.210.335

zbMATH Keywords

knapsack problem, complementarity, facet

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Easily Computable Facets of the Knapsack Polytope
• A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
• On the facets of the mixed-integer knapsack polyhedron
• The Integer Knapsack Cover Polyhedron

Cited in

(21)

• On the facets of the mixed-integer knapsack polyhedron
• Models for representing piecewise linear cost functions
• A concise characterization of strong knapsack facets
• Branch-and-cut for linear programs with overlapping SOS1 constraints
• A polyhedral study of nonconvex quadratic programs with box constraints
• Convexification techniques for linear complementarity constraints
• A polyhedral study of the semi-continuous knapsack problem
• Convexification techniques for linear complementarity constraints
• Easily Computable Facets of the Knapsack Polytope
• Obtaining tighter relaxations of mathematical programs with complementarity constraints
• Alternative formulations for the set packing problem and their application to the winner determination problem
• A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
• Branch-and-cut for complementarity-constrained optimization
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
• New classes of facets for complementarity knapsack problems
• New classes of facets for complementarity knapsack problems
• Cardinality minimization, constraints, and regularization: a survey
• Relaxations and cutting planes for linear programs with complementarity constraints
• Cutting planes in integer and mixed integer programming
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Box-constrained quadratic programs with fixed charge variables

This page was built for publication: Facets of the Complementarity Knapsack Polytope

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