Robert Weismantel

According to our database1, Robert Weismantel authored at least 123 papers between 1992 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma.
ACM Trans. Algorithms, 2020

Subset Selection in Sparse Matrices.
SIAM J. Optim., 2020

Distances between optimal solutions of mixed-integer programs.
Math. Program., 2020

N-fold integer programming via LP rounding.
CoRR, 2020

The Integrality Number of an Integer Program.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Most IPs with bounded determinants can be solved in polynomial time.
CoRR, 2019

Sparsity of Integer Solutions in the Average Case.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

The Support of Integer Optimal Solutions.
SIAM J. Optim., 2018

On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants.
SIAM J. Discret. Math., 2018

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix.
Math. Program., 2018

Optimality certificates for convex minimization and Helly numbers.
Oper. Res. Lett., 2017

A strongly polynomial algorithm for bimodular integer linear programming.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A note on non-degenerate integer programs with small sub-determinants.
Oper. Res. Lett., 2016

Duality for mixed-integer convex minimization.
Math. Program., 2016

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane.
Math. Oper. Res., 2016

Relaxations of mixed integer sets from lattice-free polyhedra.
Annals OR, 2016

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Polyhedral Frobenius Theorem with Applications to Integer Optimization.
SIAM J. Discret. Math., 2015

Note on the complexity of the mixed-integer hull of a polyhedron.
Oper. Res. Lett., 2015

Integer convex minimization by mixed integer linear optimization.
Oper. Res. Lett., 2014

Graver basis and proximity techniques for block-structured separable convex integer minimization problems.
Math. Program., 2014

Integer quadratic programming in the plane.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Time-Expanded Packings.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On convergence in mixed integer programming.
Math. Program., 2012

The quadratic Graver cone, quadratic integer minimization, and extensions.
Math. Program., 2012

Cone superadditivity of discrete convex functions.
Math. Program., 2012

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.
Math. Program., 2012

An algorithmic framework for network reconstruction.
Theor. Comput. Sci., 2011

Integrating Signals from the T-Cell Receptor and the Interleukin-2 Receptor.
PLoS Computational Biology, 2011

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts.
Oper. Res. Lett., 2011

<i>N</i>-fold integer programming and nonlinear multi-transshipment.
Optim. Lett., 2011

The combinatorics of modeling and analyzing biological systems.
Nat. Comput., 2011

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks.
Nat. Comput., 2011

A polynomial oracle-time algorithm for convex integer minimization.
Math. Program., 2011

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three.
Math. Oper. Res., 2011

Graph problems arising from parameter identification of discrete dynamical systems.
Math. Methods Oper. Res., 2011

Integer Programming Subject to Monomial Constraints.
SIAM J. Optim., 2010

Parametric nonlinear discrete optimization over well-described sets and matroid intersections.
Math. Program., 2010

Mixed-integer sets from two rows of two adjacent simplex bases.
Math. Program., 2010

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets.
Math. Oper. Res., 2010

Intractability of approximate multi-dimensional nonlinear optimization on independence systems.
CoRR, 2010

A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points.
Comput. Chem. Eng., 2010

Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks.
BMC Syst. Biol., 2010

A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fold 4-Block Decomposable Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Zero-Coefficient Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Nonlinear Integer Programming.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows.
SIAM J. Optim., 2009

Approximate Nonlinear Optimization over Weighted Independence Systems.
SIAM J. Discret. Math., 2009

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks.
J. Satisf. Boolean Model. Comput., 2009

Logic Integer Programming Models for Signaling Networks.
J. Comput. Biol., 2009

Multicommodity Flow in Polynomial Time.
CoRR, 2009

A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009

Nonlinear Optimization over a Weighted Independence System.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

The Convex Envelope of (n--1)-Convex Functions.
SIAM J. Optim., 2008

Nonlinear Matroid Optimization and Experimental Design.
SIAM J. Discret. Math., 2008

On test sets for nonlinear integer maximization.
Oper. Res. Lett., 2008

Certificates of linear mixed integer infeasibility.
Oper. Res. Lett., 2008

Polyhedral properties for the intersection of two knapsacks.
Math. Program., 2008

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program., 2008

A mathematical approach to solve the network reconstruction problem.
Math. Methods Oper. Res., 2008

N-fold integer programming.
Discret. Optim., 2008

Intermediate integer programming representations using value disjunctions.
Discret. Optim., 2008

Throughput-Optimal Sequences for Cyclically Operated Plants.
Discret. Event Dyn. Syst., 2008

Global analysis of combined reaction distillation processes.
Comput. Chem. Eng., 2008

Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosyst., 2008

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

Representation of Sets of Lattice Points.
SIAM J. Optim., 2007

A Logical Model Provides Insights into T Cell Receptor Signaling.
PLoS Computational Biology, 2007

A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization.
Comput. Chem. Eng., 2007

Inequalities from Two Rows of a Simplex Tableau.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.
SIAM J. Discret. Math., 2006

Polyhedra related to integer-convex polynomial systems.
Math. Program., 2006

Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res., 2006

Nondecomposable solutions to group equations and an application to polyhedral combinatorics.
4OR, 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimization over integers.
Athena Scientific, ISBN: 978-0-97591-462-5, 2005

Optimality criterion for a class of nonlinear integer programs.
Oper. Res. Lett., 2004

Cutting planes from a mixed integer Farkas lemma.
Oper. Res. Lett., 2004

Extended formulations for Gomory Corner polyhedra.
Discret. Optim., 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.
Proceedings of the Sharpest Cut, 2004

An algorithm for mixed integer optimization.
Math. Program., 2003

Integral decomposition of polyhedra and some applications in mixed integer programming.
Math. Program., 2003

A primal all-integer algorithm based on irreducible solutions.
Math. Program., 2003

The Complexity of Generic Primal Algorithms for Solving General Integer Programs.
Math. Oper. Res., 2002

Math. Methods Oper. Res., 2002

Exponential irreducible neighborhoods for combinatorial optimization problems.
Math. Methods Oper. Res., 2002

Cutting planes in integer and mixed integer programming.
Discret. Appl. Math., 2002

Non-standard approaches to integer programming.
Discret. Appl. Math., 2002

Diophantine Approximations and Integer Points of Cones.
Comb., 2002

A Generalization of Edmonds' Matching and Matroid Intersection Algorithms.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

A Primal Approach to the Stable Set Problem.
Proceedings of the Algorithms, 2002

The integral basis method for integer programming.
Math. Methods Oper. Res., 2001

Discrete relaxations of combinatorial programs.
Discret. Appl. Math., 2001

Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.
Proceedings of the Combinatorial Optimization, 2001

Set packing relaxations of some integer programs.
Math. Program., 2000

A Semidefinite Programming Approach to the Quadratic Knapsack Problem.
J. Comb. Optim., 2000

An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

The Sequential Knapsack Polytope.
SIAM J. Optim., 1998

The node capacitated graph partitioning problem: A computational study.
Math. Program., 1998

Test sets of integer programs.
Math. Methods Oper. Res., 1998

The Intersection of Knapsack Polyhedra and Extensions.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

A Variant of the Buchberger Algorithm for Integer Programming.
SIAM J. Discret. Math., 1997

On the 0/1 knapsack polytope.
Math. Program., 1997

The Steiner tree packing problem in VLSI design.
Math. Program., 1997

Book reviews.
Math. Methods Oper. Res., 1997

Truncated Gröbner Bases for Integer Programming.
Appl. Algebra Eng. Commun. Comput., 1997

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.
Proceedings of the Algorithms, 1997

Decomposition of Integer Programs and of Generating Sets.
Proceedings of the Algorithms, 1997

Solving Multiple Knapsack Problems by Cutting Planes.
SIAM J. Optim., 1996

Packing Steiner Trees: Separation Algorithms.
SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.
Math. Program., 1996

Packing Steiner trees: polyhedral investigations.
Math. Program., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996

Hilbert Bases and the Facets of Special Knapsack Polytopes.
Math. Oper. Res., 1996

Packing Steiner Trees: Further Facets.
Eur. J. Comb., 1996

Test Sets and Inequalities for Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Quadratic Knapsack Relaxations Using Cutting Planes.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Routing in grid graphs by cutting planes.
Math. Methods Oper. Res., 1995

0/1-Integer Programming: Optimization and Augmentation are Equivalent.
Proceedings of the Algorithms, 1995

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program., 1994

Some integer programs arising in the design of main frame computers.
ZOR Methods Model. Oper. Res., 1993

Plazieren von Zellen: Theorie und Lösung eines quadratischen 0/1-Optimierungsproblems.
PhD thesis, 1992