Linear complementarity as a general solution method to combinatorial problems
From MaRDI portal
Recommendations
Cited in
(12)- An enumerative method for the solution of linear complementarity problems
- Crashing a maximum-weight complementary basis
- An extension of interior point potential reduction algorithm to solve general lcps
- On the numerical solution of the linear complementarity problem
- Linear complementarity problems solvable by integer programming
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- scientific article; zbMATH DE number 165534 (Why is no real title available?)
- Linear complementarity problems solvable as linear programs
- scientific article; zbMATH DE number 3908160 (Why is no real title available?)
- scientific article; zbMATH DE number 819135 (Why is no real title available?)
- Global Optimization Approach to the Linear Complementarity Problem
- A shape and topology optimization technique for solving a class of linear complementarity problems in function space
This page was built for publication: Linear complementarity as a general solution method to combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892313)