Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displaying 18 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Random utility models and their applications: Recent developments (Q1867815) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Distributionally robust optimization with polynomial densities: theory, models and algorithms (Q2189441) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- The Alcuin Number of a Graph (Q3541095) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
