Pages that link to "Item:Q1693865"
From MaRDI portal
The following pages link to Compact extended linear programming models (Q1693865):
Displaying 10 items.
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Compact optimization can outperform separation: a case study in structural proteomics (Q1762887) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)