Facets of the Complementarity Knapsack Polytope
From MaRDI portal
Publication:5704071
DOI10.1287/moor.27.1.210.335zbMath1082.90586OpenAlexW2011130308MaRDI QIDQ5704071
Nemhauser, George I., Ellis L. Johnson, Ismael Regis jun. de Farias
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27)
Related Items
Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Branch-and-cut for linear programs with overlapping SOS1 constraints, Alternative formulations for the set packing problem and their application to the winner determination problem, New classes of facets for complementarity knapsack problems, A polyhedral study of the semi-continuous knapsack problem, Models for representing piecewise linear cost functions, Box-constrained quadratic programs with fixed charge variables, Branch-and-cut for complementarity-constrained optimization, Convexification Techniques for Linear Complementarity Constraints, Cutting planes in integer and mixed integer programming, A polyhedral study of nonconvex quadratic programs with box constraints, Convexification techniques for linear complementarity constraints
