The integer linear complementarity problem
From MaRDI portal
Recommendations
- Linear complementarity problems solvable by integer programming
- scientific article; zbMATH DE number 653034
- Integer solution for linear complementarity problem
- Generalized linear complementarity in a problem of \(n\)-person games
- An enumerative method for the solution of linear complementarity problems
Cites work
- Bounds for the solution set of linear complementarity problems
- Equilibria of Polymatrix Games
- Global Optimization Approach to the Linear Complementarity Problem
- Indivisible commodities and general equilibrium theory
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Linear complementarity problems solvable by integer programming
- Probability of a pure equilibrium point in n-person games
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
Cited in
(12)- Solving discretely constrained mixed complementarity problems using a median function
- Total dual integrality of the linear complementarity problem
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- On independent cliques and linear complementarity problems
- Linear complementarity problems and bi-linear games.
- A complete and terminating approach to linear integer solving
- A method for solving the general parametric linear complementarity problem
- Solving binary-constrained mixed complementarity problems using continuous reformulations
- Integer solution for linear complementarity problem
- Linear complementarity problems solvable by integer programming
- scientific article; zbMATH DE number 653034 (Why is no real title available?)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
This page was built for publication: The integer linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009715)