Relaxations and cutting planes for linear programs with complementarity constraints

Cites Work

Unnamed Item
On linear programs with linear complementarity constraints
Branch-and-cut for complementarity-constrained optimization
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
The Boolean quadratic polytope: Some characteristics, facets and relatives
Disjunctive programming: Properties of the convex hull of feasible points
A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
A polyhedral study of the cardinality constrained knapsack problem
Branch-and-cut for linear programs with overlapping SOS1 constraints
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
Conflict graphs in solving integer programming problems
Convexification techniques for linear complementarity constraints
Enhanced intersection cutting-plane approach for linear complementarity problems
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
The bipartite Boolean quadric polytope
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
Enumeration of the facets of cut polytopes over some highly symmetric graphs
The Knapsack Problem with Conflict Graphs
Integer Programming
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
On the Global Solution of Linear Programs with Linear Complementarity Constraints
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
Transportation problem with nonlinear side constraints a branch and bound approach
THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Cutting-Planes for Complementarity Constraints
Engineering and Economic Applications of Complementarity Problems
On the facial structure of set packing polyhedra
Technical Note—The Use of Cuts in Complementary Programming
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Facets of the Complementarity Knapsack Polytope
The mixed vertex packing problem.
New classes of facets for complementarity knapsack problems

This page was built for publication: Relaxations and cutting planes for linear programs with complementarity constraints