The following pages link to Robert Weismantel (Q210498):
Displaying 39 items.
- The Sequential Knapsack Polytope (Q4389190) (← links)
- (Q4398360) (← links)
- (Q4400647) (← links)
- (Q4411388) (← links)
- (Q4414637) (← links)
- An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra (Q4575702) (← links)
- Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations (Q4575902) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- (Q4607934) (← links)
- Test sets and inequalities for integer programs (Q4645910) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- (Q4737513) (← links)
- Routing in grid graphs by cutting planes (Q4845139) (← links)
- Packing Steiner Trees: Separation Algorithms (Q4881289) (← links)
- Solving Multiple Knapsack Problems by Cutting Planes (Q4895625) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma (Q4973054) (← links)
- A strongly polynomial algorithm for bimodular integer linear programming (Q4978060) (← links)
- The Integrality Number of an Integer Program (Q5041756) (← links)
- On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
- The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
- Time-Expanded Packings (Q5167731) (← links)
- Mirror-Descent Methods in Mixed-Integer Convex Optimization (Q5265166) (← links)
- (Q5292087) (← links)
- Integer quadratic programming in the plane (Q5384023) (← links)
- Integer Polynomial Optimization in Fixed Dimension (Q5387970) (← links)
- Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets (Q5426880) (← links)
- Inequalities from Two Rows of a Simplex Tableau (Q5429253) (← links)
- Representation of Sets of Lattice Points (Q5444284) (← links)
- (Q5465110) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- The Complexity of Generic Primal Algorithms for Solving General Integer Programs (Q5704103) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)
- Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity (Q6075921) (← links)
- 0/1-Integer programming: Optimization and Augmentation are equivalent (Q6102323) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube (Q6155880) (← links)
