Branch-and-cut for complementarity-constrained optimization

DOI10.1007/s12532-014-0070-2zbMath1305.90308OpenAlexW2035640668MaRDI QIDQ482112

E. Kozyreff, Ismael Regis jun. de Farias, Ming Zhao

Publication date: 19 December 2014

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-014-0070-2

zbMATH Keywords

complementaritybranch-and-cutmixed-integer programmingpolyhedral methodspecial ordered setknapsack setmultiple-choice

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) 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 (4)

Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ New classes of facets for complementarity knapsack problems ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ On the structure of linear programs with overlapping cardinality constraints

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Mixed integer minimization models for piecewise-linear functions of a single variable
• Nurse scheduling with tabu search and strategic oscillation
• Integer and mixed-integer programming models: General properties
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Convexification Techniques for Linear Complementarity Constraints
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
• Solving Large-Scale Zero-One Linear Programming Problems
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• Cutting-Planes for Complementarity Constraints
• Technical Note—The Use of Cuts in Complementary Programming
• Facets of the Complementarity Knapsack Polytope

This page was built for publication: Branch-and-cut for complementarity-constrained optimization