Plazieren von Zellen: Theorie und Lösung eines quadratischen 0/1-Optimierungsproblems. - Robert Weismantel (1992)

Some integer programs arising in the design of main frame computers. - Carlos E. Ferreira; Martin Grötschel; Alexander Martin 001; Robert Weismantel; Stefan Kiefl; Ludwig Krispenz (ZOR Methods Model. Oper. Res., 1993)

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. - Michael Jünger; Alexander Martin 001; Gerhard Reinelt; Robert Weismantel (Math. Program., 1994)

0/1-Integer Programming: Optimization and Augmentation are Equivalent. - Andreas S. Schulz; Robert Weismantel; Günter M. Ziegler (ESA, 1995)

Routing in grid graphs by cutting planes. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Methods Oper. Res., 1995)

Quadratic Knapsack Relaxations Using Cutting Planes. - Christoph Helmberg; Franz Rendl; Robert Weismantel (IPCO, 1996)

Test Sets and Inequalities for Integer Programs. - Rekha R. Thomas; Robert Weismantel (IPCO, 1996)

Packing Steiner Trees: Further Facets. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Eur. J. Comb., 1996)

Hilbert Bases and the Facets of Special Knapsack Polytopes. - Robert Weismantel (Math. Oper. Res., 1996)

Formulations and valid inequalities for the node capacitated graph partitioning problem. - Carlos Eduardo Ferreira; Alexander Martin 001; C. Carvalho de Souza; Robert Weismantel; Laurence A. Wolsey (Math. Program., 1996)

Packing Steiner trees: polyhedral investigations. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1996)

Packing Steiner trees: a cutting plane algorithm and computational results. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1996)

Packing Steiner Trees: Separation Algorithms. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (SIAM J. Discret. Math., 1996)

Solving Multiple Knapsack Problems by Cutting Planes. - Carlos E. Ferreira; Alexander Martin 001; Robert Weismantel (SIAM J. Optim., 1996)

Decomposition of Integer Programs and of Generating Sets. - Gérard Cornuéjols; Regina Urbaniak; Robert Weismantel; Laurence A. Wolsey (ESA, 1997)

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. - Martin Henk; Robert Weismantel (ESA, 1997)

Truncated Gröbner Bases for Integer Programming. - Rekha R. Thomas; Robert Weismantel (Appl. Algebra Eng. Commun. Comput., 1997)

Book reviews. - Shmuel Onn; Robert Weismantel; Peter Brucker (Math. Methods Oper. Res., 1997)

The Steiner tree packing problem in VLSI design. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1997)

On the 0/1 knapsack polytope. - Robert Weismantel (Math. Program., 1997)

A Variant of the Buchberger Algorithm for Integer Programming. - Regina Urbaniak; Robert Weismantel; Günter M. Ziegler (SIAM J. Discret. Math., 1997)

The Intersection of Knapsack Polyhedra and Extensions. - Alexander Martin 001; Robert Weismantel (IPCO, 1998)

Test sets of integer programs. - Robert Weismantel (Math. Methods Oper. Res., 1998)

The node capacitated graph partitioning problem: A computational study. - Carlos Eduardo Ferreira; Alexander Martin 001; C. Carvalho de Souza; Robert Weismantel; Laurence A. Wolsey (Math. Program., 1998)

The Sequential Knapsack Polytope. - Yves Pochet; Robert Weismantel (SIAM J. Optim., 1998)

An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. - Andreas S. Schulz; Robert Weismantel (SODA, 1999)

A Semidefinite Programming Approach to the Quadratic Knapsack Problem. - Christoph Helmberg; Franz Rendl; Robert Weismantel (J. Comb. Optim., 2000)

Set packing relaxations of some integer programs. - Ralf Borndörfer; Robert Weismantel (Math. Program., 2000)

Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. - Robert T. Firla; Bianca Spille; Robert Weismantel (Combinatorial Optimization, 2001)

Discrete relaxations of combinatorial programs. - Ralf Borndörfer; Robert Weismantel (Discret. Appl. Math., 2001)

The integral basis method for integer programming. - Utz-Uwe Haus; Matthias Köppe; Robert Weismantel (Math. Methods Oper. Res., 2001)

A Primal Approach to the Stable Set Problem. - Claudio Gentile; Utz-Uwe Haus; Matthias Köppe; Giovanni Rinaldi; Robert Weismantel (ESA, 2002)

A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. - Bianca Spille; Robert Weismantel (IPCO, 2002)

Diophantine Approximations and Integer Points of Cones. - Martin Henk; Robert Weismantel (Comb., 2002)

Non-standard approaches to integer programming. - Karen I. Aardal; Robert Weismantel; Laurence A. Wolsey (Discret. Appl. Math., 2002)

Cutting planes in integer and mixed integer programming. - Hugues Marchand; Alexander Martin 001; Robert Weismantel; Laurence A. Wolsey (Discret. Appl. Math., 2002)

Exponential irreducible neighborhoods for combinatorial optimization problems. - Robert T. Firla; Bianca Spille; Robert Weismantel (Math. Methods Oper. Res., 2002)

Preface. - Michael Jünger; Rüdiger Schultz; Robert Weismantel (Math. Methods Oper. Res., 2002)

The Complexity of Generic Primal Algorithms for Solving General Integer Programs. - Andreas S. Schulz; Robert Weismantel (Math. Oper. Res., 2002)

A primal all-integer algorithm based on irreducible solutions. - Utz-Uwe Haus; Matthias Köppe; Robert Weismantel (Math. Program., 2003)

Integral decomposition of polyhedra and some applications in mixed integer programming. - Martin Henk; Matthias Köppe; Robert Weismantel (Math. Program., 2003)

An algorithm for mixed integer optimization. - Matthias Köppe; Robert Weismantel (Math. Program., 2003)

On the Way to Perfection: Primal Operations for Stable Sets in Graphs. - Claudio Gentile; Utz-Uwe Haus; Matthias Köppe; Giovanni Rinaldi; Robert Weismantel (The Sharpest Cut, 2004)

Extended formulations for Gomory Corner polyhedra. - Matthias Köppe; Quentin Louveaux; Robert Weismantel; Laurence A. Wolsey (Discret. Optim., 2004)

Cutting planes from a mixed integer Farkas lemma. - Matthias Köppe; Robert Weismantel (Oper. Res. Lett., 2004)

Optimality criterion for a class of nonlinear integer programs. - Kazuo Murota; Hiroo Saito; Robert Weismantel (Oper. Res. Lett., 2004)

Optimization over integers. - Dimitris Bertsimas; Robert Weismantel (Athena Scientific, 2005)

FPTAS for mixed-integer polynomial optimization with a fixed number of variables. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (SODA, 2006)

Nondecomposable solutions to group equations and an application to polyhedral combinatorics. - Matthias Jach; Matthias Köppe; Robert Weismantel (4OR, 2006)

Integer Polynomial Optimization in Fixed Dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Oper. Res., 2006)

Polyhedra related to integer-convex polynomial systems. - Dennis Michaels; Robert Weismantel (Math. Program., 2006)

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets. - Claudio Gentile; Paolo Ventura; Robert Weismantel (SIAM J. Discret. Math., 2006)

Inequalities from Two Rows of a Simplex Tableau. - Kent Andersen; Quentin Louveaux; Robert Weismantel; Laurence A. Wolsey (IPCO, 2007)

A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization. - Utz-Uwe Haus; Dennis Michaels; Andreas Seidel-Morgenstern; Robert Weismantel (Comput. Chem. Eng., 2007)

A Logical Model Provides Insights into T Cell Receptor Signaling. - Julio Saez-Rodriguez; Luca Simeoni; Jonathan A. Lindquist; Rebecca Hemenway; Ursula Bommhardt; Boerge Arndt; Utz-Uwe Haus; Robert Weismantel; Ernst Dieter Gilles; Steffen Klamt; Burkhart Schraven (PLoS Comput. Biol., 2007)

Representation of Sets of Lattice Points. - Raymond Hemmecke; Robert Weismantel (SIAM J. Optim., 2007)

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. - Markus Durzinsky; Annegret Wagler; Robert Weismantel (CMSB, 2008)

Automatic reconstruction of molecular and genetic networks from discrete time series data. - Markus Durzinsky; Annegret Wagler; Robert Weismantel; Wolfgang Marwan (Biosyst., 2008)

Global analysis of combined reaction distillation processes. - Jignesh Gangadwala; Utz-Uwe Haus; Matthias Jach; Achim Kienle; Dennis Michaels; Robert Weismantel (Comput. Chem. Eng., 2008)

Throughput-Optimal Sequences for Cyclically Operated Plants. - Eckart Mayer; Utz-Uwe Haus; Jörg Raisch; Robert Weismantel (Discret. Event Dyn. Syst., 2008)

Intermediate integer programming representations using value disjunctions. - Matthias Köppe; Quentin Louveaux; Robert Weismantel (Discret. Optim., 2008)

N-fold integer programming. - Jesús A. De Loera; Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Discret. Optim., 2008)

A mathematical approach to solve the network reconstruction problem. - Wolfgang Marwan; Annegret Wagler; Robert Weismantel (Math. Methods Oper. Res., 2008)

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Program., 2008)

Polyhedral properties for the intersection of two knapsacks. - Quentin Louveaux; Robert Weismantel (Math. Program., 2008)

Certificates of linear mixed integer infeasibility. - Kent Andersen; Quentin Louveaux; Robert Weismantel (Oper. Res. Lett., 2008)

On test sets for nonlinear integer maximization. - Jon Lee 001; Shmuel Onn; Robert Weismantel (Oper. Res. Lett., 2008)

Nonlinear Matroid Optimization and Experimental Design. - Yael Berstein; Jon Lee 001; Hugo Maruri-Aguilar; Shmuel Onn; Eva Riccomagno; Robert Weismantel; Henry P. Wynn (SIAM J. Discret. Math., 2008)

The Convex Envelope of (n–1)-Convex Functions. - Matthias Jach; Dennis Michaels; Robert Weismantel (SIAM J. Optim., 2008)

Nonlinear Optimization over a Weighted Independence System. - Jon Lee 001; Shmuel Onn; Robert Weismantel (AAIM, 2009)

A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems. - Steffen Borchers; Philipp Rumschinski; Sandro Bosio; Robert Weismantel; Rolf Findeisen (CDC, 2009)

Multicommodity Flow in Polynomial Time. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (CoRR, 2009)

Logic Integer Programming Models for Signaling Networks. - Utz-Uwe Haus; Kathrin Niermann; Klaus Truemper; Robert Weismantel (J. Comput. Biol., 2009)

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. - Utz-Uwe Haus; Klaus Truemper; Robert Weismantel (J. Satisf. Boolean Model. Comput., 2009)

Approximate Nonlinear Optimization over Weighted Independence Systems. - Jon Lee 001; Shmuel Onn; Robert Weismantel (SIAM J. Discret. Math., 2009)

On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows. - Kent Andersen; Christian Wagner 006; Robert Weismantel (SIAM J. Optim., 2009)

Nonlinear Integer Programming. - Raymond Hemmecke; Matthias Köppe; Jon Lee 001; Robert Weismantel (50 Years of Integer Programming, 2010)

Zero-Coefficient Cuts. - Kent Andersen; Robert Weismantel (IPCO, 2010)

A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. - Raymond Hemmecke; Matthias Köppe; Robert Weismantel (IPCO, 2010)

Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks. - Philipp Rumschinski; Steffen Borchers; Sandro Bosio; Robert Weismantel; Rolf Findeisen (BMC Syst. Biol., 2010)

A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points. - Martin Ballerstein; Dennis Michaels; Andreas Seidel-Morgenstern; Robert Weismantel (Comput. Chem. Eng., 2010)

Intractability of approximate multi-dimensional nonlinear optimization on independence systems. - Jon Lee 001; Shmuel Onn; Robert Weismantel (CoRR, 2010)

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets. - Kent Andersen; Quentin Louveaux; Robert Weismantel (Math. Oper. Res., 2010)

Mixed-integer sets from two rows of two adjacent simplex bases. - Kent Andersen; Quentin Louveaux; Robert Weismantel (Math. Program., 2010)

Parametric nonlinear discrete optimization over well-described sets and matroid intersections. - Yael Berstein; Jon Lee 001; Shmuel Onn; Robert Weismantel (Math. Program., 2010)

Integer Programming Subject to Monomial Constraints. - Christoph Buchheim; Dennis Michaels; Robert Weismantel (SIAM J. Optim., 2010)

Graph problems arising from parameter identification of discrete dynamical systems. - Steffen Borchers; Sandro Bosio; Rolf Findeisen; Utz-Uwe Haus; Philipp Rumschinski; Robert Weismantel (Math. Methods Oper. Res., 2011)

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. - Gennadiy Averkov; Christian Wagner 006; Robert Weismantel (Math. Oper. Res., 2011)

A polynomial oracle-time algorithm for convex integer minimization. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Math. Program., 2011)

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks. - Wolfgang Marwan; Annegret Wagler; Robert Weismantel (Nat. Comput., 2011)

The combinatorics of modeling and analyzing biological systems. - Annegret Wagler; Robert Weismantel (Nat. Comput., 2011)

N-fold integer programming and nonlinear multi-transshipment. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Optim. Lett., 2011)

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. - Alberto Del Pia; Christian Wagner 006; Robert Weismantel (Oper. Res. Lett., 2011)

Integrating Signals from the T-Cell Receptor and the Interleukin-2 Receptor. - Tilo Beyer; Mandy Busse; Kroum Hristov; Slavyana Gurbiel; Michal Smida; Utz-Uwe Haus; Kathrin Ballerstein; Frank Pfeuffer; Robert Weismantel; Burkhart Schraven; Jonathan A. Lindquist (PLoS Comput. Biol., 2011)

An algorithmic framework for network reconstruction. - Markus Durzinsky; Annegret Wagler; Robert Weismantel (Theor. Comput. Sci., 2011)

Relaxations of mixed integer sets from lattice-free polyhedra. - Alberto Del Pia; Robert Weismantel (4OR, 2012)

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. - Michel Baes; Alberto Del Pia; Yurii E. Nesterov; Shmuel Onn; Robert Weismantel (Math. Program., 2012)

Cone superadditivity of discrete convex functions. - Yusuke Kobayashi 001; Kazuo Murota; Robert Weismantel (Math. Program., 2012)

The quadratic Graver cone, quadratic integer minimization, and extensions. - Jon Lee 001; Shmuel Onn; Lyubov Romanchuk; Robert Weismantel (Math. Program., 2012)

On convergence in mixed integer programming. - Alberto Del Pia; Robert Weismantel (Math. Program., 2012)

Time-Expanded Packings. - David Adjiashvili; Sandro Bosio; Robert Weismantel; Rico Zenklusen (ICALP (1), 2014)

Integer quadratic programming in the plane. - Alberto Del Pia; Robert Weismantel (SODA, 2014)

Graver basis and proximity techniques for block-structured separable convex integer minimization problems. - Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Program., 2014)

Integer convex minimization by mixed integer linear optimization. - Timm Oertel; Christian Wagner 006; Robert Weismantel (Oper. Res. Lett., 2014)

Note on the complexity of the mixed-integer hull of a polyhedron. - Robert Hildebrand; Timm Oertel; Robert Weismantel (Oper. Res. Lett., 2015)

A Polyhedral Frobenius Theorem with Applications to Integer Optimization. - David Adjiashvili; Timm Oertel; Robert Weismantel (SIAM J. Discret. Math., 2015)

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. - Robert Hildebrand; Robert Weismantel; Kevin Zemmer (SODA, 2016)

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. - Alberto Del Pia; Robert Hildebrand; Robert Weismantel; Kevin Zemmer (Math. Oper. Res., 2016)

Duality for mixed-integer convex minimization. - Michel Baes; Timm Oertel; Robert Weismantel (Math. Program., 2016)

A note on non-degenerate integer programs with small sub-determinants. - Stephan Artmann; Friedrich Eisenbrand; Christoph Glanzer; Timm Oertel; Santosh S. Vempala; Robert Weismantel (Oper. Res. Lett., 2016)

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. - Robert Hildebrand; Robert Weismantel; Rico Zenklusen (SODA, 2017)

A strongly polynomial algorithm for bimodular integer linear programming. - Stephan Artmann; Robert Weismantel; Rico Zenklusen (STOC, 2017)

Optimality certificates for convex minimization and Helly numbers. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Robert Weismantel; Stefan Weltge (Oper. Res. Lett., 2017)

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. - Jörg Bader; Robert Hildebrand; Robert Weismantel; Rico Zenklusen (Math. Program., 2018)

On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. - Christoph Glanzer; Robert Weismantel; Rico Zenklusen (SIAM J. Discret. Math., 2018)

The Support of Integer Optimal Solutions. - Iskander Aliev; Jesús A. De Loera; Friedrich Eisenbrand; Timm Oertel; Robert Weismantel (SIAM J. Optim., 2018)

Sparsity of Integer Solutions in the Average Case. - Timm Oertel; Joseph Paat; Robert Weismantel (IPCO, 2019)

Most IPs with bounded determinants can be solved in polynomial time. - Joseph Paat; Miriam Schlöter; Robert Weismantel (CoRR, 2019)

N-fold integer programming via LP rounding. - Jana Cslovjecsek; Friedrich Eisenbrand; Robert Weismantel (CoRR, 2020)

Distances between optimal solutions of mixed-integer programs. - Joseph Paat; Robert Weismantel; Stefan Weltge (Math. Program., 2020)

The Distributions of Functions Related to Parametric Integer Optimization. - Timm Oertel; Joseph Paat; Robert Weismantel (SIAM J. Appl. Algebra Geom., 2020)

Subset Selection in Sparse Matrices. - Alberto Del Pia; Santanu S. Dey; Robert Weismantel (SIAM J. Optim., 2020)

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. - Friedrich Eisenbrand; Robert Weismantel (ACM Trans. Algorithms, 2020)

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. - Jana Cslovjecsek; Friedrich Eisenbrand; Michal Pilipczuk; Moritz Venzin; Robert Weismantel (ESA, 2021)

On the Recognition of a, b, c-Modular Matrices. - Christoph Glanzer; Ingo Stallknecht; Robert Weismantel (IPCO, 2021)

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. - Jana Cslovjecsek; Friedrich Eisenbrand; Christoph Hunkenschröder; Lars Rohwedder; Robert Weismantel (SODA, 2021)

Notes on {a, b, c}-Modular Matrices. - Christoph Glanzer; Ingo Stallknecht; Robert Weismantel (CoRR, 2021)

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. - Marcel Celaya; Stefan Kuhlmann; Joseph Paat; Robert Weismantel (IPCO, 2022)

Optimizing a low-dimensional convex function over a high-dimensional cube. - Christoph Hunkenschröder; Sebastian Pokutta; Robert Weismantel (CoRR, 2022)

Minimum-Cost Flows Over Time. - Miriam Schlöter; Robert Weismantel (CoRR, 2022)

The integrality number of an integer program. - Joseph Paat; Miriam Schlöter; Robert Weismantel (Math. Program., 2022)

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. - Martin Henk; Stefan Kuhlmann; Robert Weismantel (SIAM J. Discret. Math., 2022)

Sparse Approximation over the Cube. - Sabrina Bruckmeier; Christoph Hunkenschröder; Robert Weismantel (IPCO, 2023)

Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube. - Christoph Hunkenschröder; Sebastian Pokutta; Robert Weismantel (SIAM J. Optim., 2023)

On Matrices over a Polynomial Ring with Restricted Subdeterminants. - Marcel Celaya; Stefan Kuhlmann; Robert Weismantel (IPCO, 2024)

Proximity and Flatness Bounds for Linear Integer Optimization. - Marcel Celaya; Stefan Kuhlmann; Joseph Paat; Robert Weismantel (Math. Oper. Res., 2024)

A colorful Steinitz Lemma with application to block-structured integer programs. - Timm Oertel; Joseph Paat; Robert Weismantel (Math. Program., 2024)

Sparse Approximation in Lattices and Semigroups. - Stefan Kuhlmann; Timm Oertel; Robert Weismantel (IPCO, 2025)

Forall-exist statements in pseudopolynomial time. - Eleonore Bach; Friedrich Eisenbrand; Thomas Rothvoss; Robert Weismantel (SODA, 2025)