Pages that link to "Item:Q1168215"
From MaRDI portal
The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):
Displaying 14 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On submodular function minimization (Q1104332) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Data-driven robust optimization (Q1702776) (← links)
- Network pollution games (Q1755784) (← links)
- On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Multilinear Games (Q2959817) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
