Pages that link to "Item:Q5183263"
From MaRDI portal
The following pages link to Technical Note—The Use of Cuts in Complementary Programming (Q5183263):
Displaying 9 items.
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)