Pages that link to "Item:Q1646682"
From MaRDI portal
The following pages link to Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682):
Displaying 9 items.
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Recovery under side constraints (Q2106480) (← 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)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024) (← 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)