Pages that link to "Item:Q482112"
From MaRDI portal
The following pages link to Branch-and-cut for complementarity-constrained optimization (Q482112):
Displaying 7 items.
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)