Robert Weismantel

From MaRDI portal
Person:210498

Available identifiers

zbMath Open weismantel.robertMaRDI QIDQ210498

List of research outcomes

PublicationDate of PublicationType
A colorful Steinitz lemma with application to block-structured integer programs2024-02-21Paper
https://portal.mardi4nfdi.de/entity/Q61473562024-01-15Paper
Forall-exist statements in pseudopolynomial time2023-11-13Paper
Sparse approximation over the cube2023-11-09Paper
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity2023-09-20Paper
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube2023-06-07Paper
0/1-Integer programming: Optimization and Augmentation are equivalent2023-05-08Paper
Alternating Linear Minimization: Revisiting von Neumann's alternating projections2022-12-06Paper
Proximity and flatness bounds for linear integer optimization2022-11-27Paper
The Integrality Number of an Integer Program2022-10-14Paper
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases2022-08-31Paper
Improving the Cook et al. proximity bound given integral valued constraints2022-08-16Paper
Notes on \(\{a,b,c\}\)-modular matrices2022-05-04Paper
The integrality number of an integer program2022-03-22Paper
On the recognition of \(\{a,b,c\}\)-modular matrices2021-12-21Paper
Decomposition of integer programs and of generating sets2021-12-20Paper
Test sets of the knapsack problem and simultaneous Diophantine approximation2021-12-20Paper
The Distributions of Functions Related to Parametric Integer Optimization2020-10-07Paper
Subset Selection in Sparse Matrices2020-04-24Paper
Sparsity of integer solutions in the average case2020-02-06Paper
Distances between optimal solutions of mixed-integer programs2020-01-17Paper
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma2019-12-02Paper
Integer quadratic programming in the plane2019-06-20Paper
Optimality certificates for convex minimization and Helly numbers2019-02-22Paper
Test sets and inequalities for integer programs2019-01-11Paper
Quadratic knapsack relaxations using cutting planes and semidefinite programming2019-01-11Paper
A note on non-degenerate integer programs with small sub-determinants2019-01-11Paper
Integer convex minimization by mixed integer linear optimization2018-09-28Paper
Note on the complexity of the mixed-integer hull of a polyhedron2018-09-28Paper
The Support of Integer Optimal Solutions2018-08-03Paper
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants2018-07-18Paper
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations2018-07-16Paper
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra2018-07-16Paper
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix2018-06-25Paper
https://portal.mardi4nfdi.de/entity/Q46079342018-03-15Paper
A strongly polynomial algorithm for bimodular integer linear programming2017-08-17Paper
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations2017-06-20Paper
Duality for mixed-integer convex minimization2016-08-25Paper
Relaxations of mixed integer sets from lattice-free polyhedra2016-07-22Paper
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane2016-05-19Paper
A Polyhedral Frobenius Theorem with Applications to Integer Optimization2015-07-31Paper
Mirror-Descent Methods in Mixed-Integer Convex Optimization2015-07-22Paper
Time-Expanded Packings2014-07-01Paper
Graver basis and proximity techniques for block-structured separable convex integer minimization problems2014-06-27Paper
The quadratic Graver cone, quadratic integer minimization, and extensions2012-12-19Paper
Relaxations of mixed integer sets from lattice-free polyhedra2012-12-07Paper
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes2012-11-02Paper
On convergence in mixed integer programming2012-10-15Paper
Cone superadditivity of discrete convex functions2012-10-15Paper
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts2012-07-13Paper
Transversal numbers over subsets of linear spaces2012-06-13Paper
Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three2012-05-24Paper
Convex integer minimization in fixed dimension2012-03-19Paper
https://portal.mardi4nfdi.de/entity/Q30967272011-11-11Paper
Graph problems arising from parameter identification of discrete dynamical systems2011-08-16Paper
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks2011-07-28Paper
The combinatorics of modeling and analyzing biological systems2011-07-28Paper
An algorithmic framework for network reconstruction2011-06-28Paper
Intractability of approximate multi-dimensional nonlinear optimization on independence systems2011-05-06Paper
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets2011-04-27Paper
Integer Programming Subject to Monomial Constraints2011-03-21Paper
\(N\)-fold integer programming and nonlinear multi-transshipment2011-03-14Paper
A polynomial oracle-time algorithm for convex integer minimization2011-02-14Paper
Approximate Nonlinear Optimization over Weighted Independence Systems2010-12-03Paper
Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three2010-10-06Paper
Parametric nonlinear discrete optimization over well-described sets and matroid intersections2010-09-16Paper
Mixed-integer sets from two rows of two adjacent simplex bases2010-09-16Paper
FPTAS for mixed-integer polynomial optimization with a fixed number of variables2010-08-16Paper
Zero-Coefficient Cuts2010-06-22Paper
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs2010-06-22Paper
Nonlinear Integer Programming2010-06-03Paper
On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows2010-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31816412009-10-12Paper
Throughput-optimal sequences for cyclically operated plants2009-10-09Paper
Nonlinear Matroid Optimization and Experimental Design2009-08-20Paper
The Convex Envelope of (n–1)-Convex Functions2009-08-20Paper
Nonlinear Optimization over a Weighted Independence System2009-07-02Paper
Convex integer maximization via Graver bases2009-05-12Paper
Maximal integral simplices with no interior integer points2009-04-14Paper
On test sets for nonlinear integer maximization2009-03-04Paper
Certificates of linear mixed integer infeasibility2009-01-09Paper
\(N\)-fold integer programming2008-10-29Paper
Intermediate integer programming representations using value disjunctions2008-10-29Paper
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension2008-10-16Paper
Nonlinear optimization for matroid intersection and extensions2008-07-24Paper
Integer Polynomial Optimization in Fixed Dimension2008-05-27Paper
A mathematical approach to solve the network reconstruction problem2008-04-23Paper
Polyhedral properties for the intersection of two knapsacks2008-03-12Paper
Representation of Sets of Lattice Points2008-02-25Paper
Inequalities from Two Rows of a Simplex Tableau2007-11-29Paper
Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets2007-11-16Paper
https://portal.mardi4nfdi.de/entity/Q52920872007-06-19Paper
Nondecomposable solutions to group equations and an application to polyhedral combinatorics2007-01-24Paper
Polyhedra related to integer-convex polynomial systems2006-01-13Paper
The Complexity of Generic Primal Algorithms for Solving General Integer Programs2005-11-11Paper
https://portal.mardi4nfdi.de/entity/Q54651102005-08-22Paper
Extended formulations for Gomory corner polyhedra2005-08-22Paper
Optimality criterion for a class of nonlinear integer programs.2005-01-11Paper
Integral Function Bases2004-10-08Paper
https://portal.mardi4nfdi.de/entity/Q47375132004-08-11Paper
Cutting planes from a mixed integer Farkas lemma.2004-03-15Paper
A primal all-integer algorithm based on irreducible solutions2004-03-11Paper
An algorithm for mixed integer optimization2004-03-11Paper
Integral decomposition of polyhedra and some applications in mixed integer programming2003-10-29Paper
https://portal.mardi4nfdi.de/entity/Q44146372003-07-25Paper
The integral basis method for integer programming2003-07-15Paper
Exponential irreducible neighborhoods for combinatorial optimization problems2003-07-14Paper
https://portal.mardi4nfdi.de/entity/Q44113882003-07-08Paper
Diophantine approximations and integer points of cones2003-05-18Paper
Non-standard approaches to integer programming2002-09-17Paper
Cutting planes in integer and mixed integer programming2002-09-17Paper
The height of minimal Hilbert bases2001-07-22Paper
Discrete relaxations of combinatorial programs2001-01-01Paper
Set packing relaxations of some integer programs2000-12-03Paper
A semidefinite programming approach to the quadratic knapsack problem2000-10-30Paper
On minimal solutions of Diophantine equations2000-04-26Paper
Test sets of integer programs1999-08-22Paper
The node capacitated graph partitioning problem: A computational study1999-06-03Paper
Truncated Gröbner bases for integer programming1999-06-01Paper
A counterexample to an integer analogue of Carathéodory's theorem1999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42341611999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42524341999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38403631998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44006471998-08-02Paper
https://portal.mardi4nfdi.de/entity/Q43983601998-07-19Paper
The Steiner tree packing problem in VLSI design1998-06-22Paper
The Sequential Knapsack Polytope1998-05-12Paper
A Variant of the Buchberger Algorithm for Integer Programming1997-05-20Paper
Hilbert Bases and the Facets of Special Knapsack Polytopes1997-02-13Paper
Solving Multiple Knapsack Problems by Cutting Planes1997-02-03Paper
Packing Steiner trees: A cutting plane algorithm and computational results1997-01-06Paper
Optimum path packing on wheels: The consecutive case1997-01-06Paper
On the \(0/1\) knapsack polytope1997-01-01Paper
Formulations and valid inequalities of the node capacitated graph partitioning problem1996-10-31Paper
Packing Steiner Trees: Separation Algorithms1996-10-03Paper
Packing Steiner trees: Further facets1996-07-14Paper
Routing in grid graphs by cutting planes1996-05-30Paper
Gröbner bases of lattices, corner polyhedra, and integer programming1996-01-01Paper
Packing Steiner trees: Polyhedral investigations1996-01-01Paper
Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits1994-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42801331994-05-24Paper
Some integer programs arising in the design of main frame computers1993-09-21Paper
https://portal.mardi4nfdi.de/entity/Q40237401993-01-23Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Robert Weismantel