Linear complementarity problems solvable by integer programming
From MaRDI portal
Numerical methods based on nonlinear programming (49M37) Linear programming (90C05) Boolean programming (90C09) Mixed integer programming (90C11) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- The integer linear complementarity problem
- scientific article; zbMATH DE number 653034
- Linear complementarity problems solvable as linear programs
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Linear complementarity as a general solution method to combinatorial problems
Cites work
- Bounds for the solution set of linear complementarity problems
- Global Optimization Approach to the Linear Complementarity Problem
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Valid inequalities for mixed 0-1 programs
Cited in
(19)- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Acceptable solutions of linear complementarity problems
- An algorithm for computing all solutions of an absolute value equation
- Total dual integrality and integral solutions of the linear complementarity problem
- On the equivalence of linear complementarity problems
- Tensor complementarity problems. II: Solution methods
- A mixed integer programming approach to the tensor complementarity problem
- On equivalent reformulations for absolute value equations
- Integer solution for linear complementarity problem
- Solving the linear complementarity problem through concave programming
- The Linear Complementarity Problems with a Few Variables per Constraint
- scientific article; zbMATH DE number 4047441 (Why is no real title available?)
- A mixed-integer linear programming problem which is efficiently solvable
- The integer linear complementarity problem
- Linear complementarity problems solvable by A single linear program
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Affinely adjustable robust linear complementarity problems
- scientific article; zbMATH DE number 4189490 (Why is no real title available?)
This page was built for publication: Linear complementarity problems solvable by integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798493)
