Weismantel Robert

Robert Weismantel

Information about the author Robert Weismantel will soon be added to the site.
Found 17 papers in total
Relaxations of mixed integer sets from lattice-free polyhedra
Relaxations of mixed integer sets from lattice-free polyhedra
2016
This paper gives an introduction to a recently established link between the geometry...
Relaxations of mixed integer sets from lattice‐free polyhedra
Relaxations of mixed integer sets from lattice‐free polyhedra
2012
This paper gives an introduction to a recently established link between the geometry...
Maximal Lattice‐Free Polyhedra: Finiteness and an Explicit Description in Dimension Three
Maximal Lattice‐Free Polyhedra: Finiteness and an Explicit Description in Dimension Three
2011
A convex set with nonempty interior is maximal lattice‐free if it is inclusion...
Graph problems arising from parameter identification of discrete dynamical systems
Graph problems arising from parameter identification of discrete dynamical systems
2011
This paper focuses on combinatorial feasibility and optimization problems that arise...
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
2011
We consider mixed integer linear sets defined by two equations involving two integer...
N‐fold integer programming and nonlinear multi‐transshipment
N‐fold integer programming and nonlinear multi‐transshipment
2011
The multi‐transshipment problem is NP‐hard already for two commodities...
Certificates of linear mixed integer infeasibility
Certificates of linear mixed integer infeasibility
2008
We derive a certificate of integral infeasibility for linear systems with equations...
An analysis of mixed integer linear sets based on lattice point free convex sets
An analysis of mixed integer linear sets based on lattice point free convex sets
2010
A maximal lattice free polyhedron L has max-facet-width equal to w if max x ∈ L...
On test sets for nonlinear integer maximization
On test sets for nonlinear integer maximization
2008
A finite test set for an integer optimization problem enables us to verify whether a...
Integer polynomial optimization in fixed dimension
Integer polynomial optimization in fixed dimension
2006
We classify, according to their computational complexity, integer optimization...
Intermediate integer programming representations using value disjunctions
Intermediate integer programming representations using value disjunctions
2008
We introduce a general technique for creating an extended formulation of a...
N-fold integer programming
N-fold integer programming
2008
In this article we study a broad class of integer programming problems in variable...
An algorithm for mixed integer optimization
An algorithm for mixed integer optimization
2003
This paper introduces a new algorithm for solving mixed integer programs. The core of...
Optimality criterion for a class of nonlinear integer programs
Optimality criterion for a class of nonlinear integer programs
2004
Graver's optimality conditions based on Hilbert bases apply to an integer program with...
Cutting planes from a mixed integer Farkas lemma
Cutting planes from a mixed integer Farkas lemma
2004
We present a mixed integer version of the lattice analogue of the Farkas lemma. It...
The complexity of generic primal algorithms for solving general integer programs
The complexity of generic primal algorithms for solving general integer programs
2002
Primal methods constitute a common approach to solving (combinatorial) optimization...
On the 0/1 knapsack polytope
On the 0/1 knapsack polytope
1997
This paper deals with the 0/1 knapsack polytope. In particular, we introduce the...
Papers per page: