The following pages link to Robert Weismantel (Q210498):
Displaying 50 items.
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Diophantine approximations and integer points of cones (Q1872892) (← links)
- Gröbner bases of lattices, corner polyhedra, and integer programming (Q1903365) (← links)
- Packing Steiner trees: Further facets (Q1908272) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- On minimal solutions of Diophantine equations (Q1975384) (← links)
- On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
- Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- Sparsity of integer solutions in the average case (Q2293093) (← links)
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
- Extended formulations for Gomory corner polyhedra (Q2386199) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
- A mathematical approach to solve the network reconstruction problem (Q2482687) (← links)
- Certificates of linear mixed integer infeasibility (Q2517805) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections (Q2638368) (← links)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- Transversal numbers over subsets of linear spaces (Q2891065) (← links)
- Approximate Nonlinear Optimization over Weighted Independence Systems (Q3058525) (← links)
- Integer Programming Subject to Monomial Constraints (Q3083332) (← links)
- (Q3096727) (← links)
- A Variant of the Buchberger Algorithm for Integer Programming (Q3128207) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets (Q3169091) (← links)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- (Q3181641) (← links)
- Nonlinear Matroid Optimization and Experimental Design (Q3393425) (← links)
- The Convex Envelope of (<i>n</i>–1)-Convex Functions (Q3395026) (← links)
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows (Q3563917) (← links)
- Nonlinear Integer Programming (Q3565244) (← links)
- Zero-Coefficient Cuts (Q3569808) (← links)
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs (Q3569820) (← links)
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables (Q3581508) (← links)
- Nonlinear Optimization over a Weighted Independence System (Q3638454) (← links)
- (Q3840363) (← links)
- (Q4023740) (← links)
- (Q4234161) (← links)
- A counterexample to an integer analogue of Carathéodory's theorem (Q4243150) (← links)
- (Q4252434) (← links)
- (Q4280133) (← links)
- Hilbert Bases and the Facets of Special Knapsack Polytopes (Q4332256) (← links)
