Pages that link to "Item:Q3329225"
From MaRDI portal
The following pages link to Geometric methods in combinatorial optimization (Q3329225):
Displaying 25 items.
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- On multivariate quantiles under partial orders (Q548551) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
- A geometric inequality and the complexity of computing volume (Q1087143) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- Geometric algorithms and combinatorial optimization. (Q1309040) (← links)
- Geometric comparison of combinatorial polytopes (Q1339395) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Some easy and some not so easy geometric optimization problems (Q1757753) (← links)
- Geometric optimization revisited (Q2075763) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Combinatorics with a geometric flavor (Q2739351) (← links)
- Geometric methods in discrete optimization (Q3028730) (← links)
- Geometry of numbers: An algorithmic view (Q3033845) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Algorithmic aspects of combinatorics, geometry and number theory (Q3683901) (← links)
- An algorithmic theory of numbers, graphs and convexity (Q3745276) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Geometric algorithms and algorithmic geometry (Q4011108) (← links)
- (Q4247198) (← links)
- (Q4252328) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
