Robert Weismantel

Math. Program., March, 2024

Sparse Approximation in Lattices and Semigroups.

[BibT_eX]

[DOI]

Stefan Kuhlmann

CoRR, 2024

On Matrices over a Polynomial Ring with Restricted Subdeterminants.

[BibT_eX]

[DOI]

Marcel Celaya

Stefan Kuhlmann

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube.

[BibT_eX]

[DOI]

Sebastian Pokutta

SIAM J. Optim., 2023

Sparse Approximation over the Cube.

[BibT_eX]

[DOI]

Sabrina Bruckmeier

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases.

[BibT_eX]

[DOI]

Stefan Kuhlmann

SIAM J. Discret. Math., September, 2022

The integrality number of an integer program.

[BibT_eX]

[DOI]

Miriam Schlöter

Math. Program., 2022

Minimum-Cost Flows Over Time.

[BibT_eX]

[DOI]

Miriam Schlöter

CoRR, 2022

Optimizing a low-dimensional convex function over a high-dimensional cube.

[BibT_eX]

[DOI]

Sebastian Pokutta

CoRR, 2022

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Notes on {a, b, c}-Modular Matrices.

[BibT_eX]

[DOI]

Christoph Glanzer

Ingo Stallknecht

CoRR, 2021

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.

[BibT_eX]

[DOI]

Jana Cslovjecsek

Friedrich Eisenbrand

Lars Rohwedder

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On the Recognition of a, b, c-Modular Matrices.

[BibT_eX]

[DOI]

Christoph Glanzer

Ingo Stallknecht

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma.

[BibT_eX]

[DOI]

Friedrich Eisenbrand

ACM Trans. Algorithms, 2020

Subset Selection in Sparse Matrices.

[BibT_eX]

[DOI]

Santanu S. Dey

SIAM J. Optim., 2020

The Distributions of Functions Related to Parametric Integer Optimization.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2020

Distances between optimal solutions of mixed-integer programs.

[BibT_eX]

[DOI]

Stefan Weltge

Math. Program., 2020

N-fold integer programming via LP rounding.

[BibT_eX]

[DOI]

Jana Cslovjecsek

Friedrich Eisenbrand

CoRR, 2020

2019

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

[BibT_eX]

[DOI]

Miriam Schlöter

CoRR, 2019

Sparsity of Integer Solutions in the Average Case.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

The Support of Integer Optimal Solutions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants.

[BibT_eX]

[DOI]

Christoph Glanzer

Rico Zenklusen

SIAM J. Discret. Math., 2018

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix.

[BibT_eX]

[DOI]

Math. Program., 2018

2017

Optimality certificates for convex minimization and Helly numbers.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

A strongly polynomial algorithm for bimodular integer linear programming.

[BibT_eX]

[DOI]

Stephan Artmann

Rico Zenklusen

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations.

[BibT_eX]

[DOI]

Robert Hildebrand

Rico Zenklusen

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

A note on non-degenerate integer programs with small sub-determinants.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Duality for mixed-integer convex minimization.

[BibT_eX]

[DOI]

Michel Baes

Math. Program., 2016

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra.

[BibT_eX]

[DOI]

Robert Hildebrand

Kevin Zemmer

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

A Polyhedral Frobenius Theorem with Applications to Integer Optimization.

[BibT_eX]

[DOI]

David Adjiashvili

SIAM J. Discret. Math., 2015

Note on the complexity of the mixed-integer hull of a polyhedron.

[BibT_eX]

[DOI]

Robert Hildebrand

Oper. Res. Lett., 2015

2014

Integer convex minimization by mixed integer linear optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Graver basis and proximity techniques for block-structured separable convex integer minimization problems.

[BibT_eX]

[DOI]

Math. Program., 2014

Integer quadratic programming in the plane.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Time-Expanded Packings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2012

On convergence in mixed integer programming.

[BibT_eX]

[DOI]

Math. Program., 2012

The quadratic Graver cone, quadratic integer minimization, and extensions.

[BibT_eX]

[DOI]

Math. Program., 2012

Cone superadditivity of discrete convex functions.

[BibT_eX]

[DOI]

Yusuke Kobayashi

Kazuo Murota

Math. Program., 2012

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.

[BibT_eX]

[DOI]

Math. Program., 2012

Relaxations of mixed integer sets from lattice-free polyhedra.

[BibT_eX]

[DOI]

4OR, 2012

2011

An algorithmic framework for network reconstruction.

[BibT_eX]

[DOI]

Markus Durzinsky

Theor. Comput. Sci., 2011

Integrating Signals from the T-Cell Receptor and the Interleukin-2 Receptor.

[BibT_eX]

[DOI]

Jonathan A. Lindquist

PLoS Comput. Biol., 2011

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

<i>N</i>-fold integer programming and nonlinear multi-transshipment.

[BibT_eX]

[DOI]

Optim. Lett., 2011

The combinatorics of modeling and analyzing biological systems.

[BibT_eX]

[DOI]

Nat. Comput., 2011

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

[BibT_eX]

[DOI]

Wolfgang Marwan

Nat. Comput., 2011

A polynomial oracle-time algorithm for convex integer minimization.

[BibT_eX]

[DOI]

Math. Program., 2011

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three.

[BibT_eX]

[DOI]

Gennadiy Averkov

Math. Oper. Res., 2011

Graph problems arising from parameter identification of discrete dynamical systems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2011

2010

Integer Programming Subject to Monomial Constraints.

[BibT_eX]

[DOI]

Christoph Buchheim

SIAM J. Optim., 2010

Parametric nonlinear discrete optimization over well-described sets and matroid intersections.

[BibT_eX]

[DOI]

Math. Program., 2010

Mixed-integer sets from two rows of two adjacent simplex bases.

[BibT_eX]

[DOI]

Math. Program., 2010

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points.

[BibT_eX]

[DOI]

Martin Ballerstein

Andreas Seidel-Morgenstern

Comput. Chem. Eng., 2010

Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2010

A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fold 4-Block Decomposable Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Zero-Coefficient Cuts.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Nonlinear Integer Programming.

[BibT_eX]

[DOI]

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

2009

On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

Approximate Nonlinear Optimization over Weighted Independence Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks.

[BibT_eX]

[DOI]

Klaus Truemper

J. Satisf. Boolean Model. Comput., 2009

Logic Integer Programming Models for Signaling Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2009

Multicommodity Flow in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2009

A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems.

[BibT_eX]

[DOI]

Proceedings of the 48th IEEE Conference on Decision and Control, 2009

Nonlinear Optimization over a Weighted Independence System.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

The Convex Envelope of (n--1)-Convex Functions.

[BibT_eX]

[DOI]

Matthias Jach

SIAM J. Optim., 2008

Nonlinear Matroid Optimization and Experimental Design.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

On test sets for nonlinear integer maximization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Certificates of linear mixed integer infeasibility.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Polyhedral properties for the intersection of two knapsacks.

[BibT_eX]

[DOI]

Math. Program., 2008

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

[BibT_eX]

[DOI]

Math. Program., 2008

A mathematical approach to solve the network reconstruction problem.

[BibT_eX]

[DOI]

Wolfgang Marwan

Math. Methods Oper. Res., 2008

N-fold integer programming.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Intermediate integer programming representations using value disjunctions.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Throughput-Optimal Sequences for Cyclically Operated Plants.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2008

Global analysis of combined reaction distillation processes.

[BibT_eX]

[DOI]

Comput. Chem. Eng., 2008

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

[BibT_eX]

[DOI]

Biosyst., 2008

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.

[BibT_eX]

[DOI]

Markus Durzinsky

Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

2007

Representation of Sets of Lattice Points.

[BibT_eX]

[DOI]

SIAM J. Optim., 2007

A Logical Model Provides Insights into T Cell Receptor Signaling.

[BibT_eX]

[DOI]

Julio Saez-Rodriguez

Luca Simeoni

Jonathan A. Lindquist

PLoS Comput. Biol., 2007

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

[BibT_eX]

[DOI]

Andreas Seidel-Morgenstern

Comput. Chem. Eng., 2007

Inequalities from Two Rows of a Simplex Tableau.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.

[BibT_eX]

[DOI]

Claudio Gentile

Paolo Ventura

SIAM J. Discret. Math., 2006

Polyhedra related to integer-convex polynomial systems.

[BibT_eX]

[DOI]

Math. Program., 2006

Integer Polynomial Optimization in Fixed Dimension.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

Nondecomposable solutions to group equations and an application to polyhedral combinatorics.

[BibT_eX]

[DOI]

Matthias Jach

4OR, 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Optimization over integers.

[BibT_eX]

Dimitris Bertsimas

Athena Scientific, ISBN: 978-0-97591-462-5, 2005

2004

Optimality criterion for a class of nonlinear integer programs.

[BibT_eX]

[DOI]

Kazuo Murota

Hiroo Saito

Oper. Res. Lett., 2004

Cutting planes from a mixed integer Farkas lemma.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Extended formulations for Gomory Corner polyhedra.

[BibT_eX]

[DOI]

Discret. Optim., 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

An algorithm for mixed integer optimization.

[BibT_eX]

[DOI]

Math. Program., 2003

Integral decomposition of polyhedra and some applications in mixed integer programming.

[BibT_eX]

[DOI]

Math. Program., 2003

A primal all-integer algorithm based on irreducible solutions.

[BibT_eX]

[DOI]

Math. Program., 2003

2002

The Complexity of Generic Primal Algorithms for Solving General Integer Programs.

[BibT_eX]

[DOI]

Andreas S. Schulz

Math. Oper. Res., 2002

Preface.

[BibT_eX]

[DOI]

Michael Jünger

Rüdiger Schultz

Math. Methods Oper. Res., 2002

Exponential irreducible neighborhoods for combinatorial optimization problems.

[BibT_eX]

[DOI]

Robert T. Firla

Bianca Spille

Math. Methods Oper. Res., 2002

Cutting planes in integer and mixed integer programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Non-standard approaches to integer programming.

[BibT_eX]

[DOI]

Karen I. Aardal

Laurence A. Wolsey

Discret. Appl. Math., 2002

Diophantine Approximations and Integer Points of Cones.

[BibT_eX]

[DOI]

Comb., 2002

A Generalization of Edmonds' Matching and Matroid Intersection Algorithms.

[BibT_eX]

[DOI]

Bianca Spille

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

A Primal Approach to the Stable Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

The integral basis method for integer programming.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2001

Discrete relaxations of combinatorial programs.

[BibT_eX]

[DOI]

Ralf Borndörfer

Discret. Appl. Math., 2001

Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.

[BibT_eX]

[DOI]

Robert T. Firla

Bianca Spille

Proceedings of the Combinatorial Optimization, 2001

2000

Set packing relaxations of some integer programs.

[BibT_eX]

[DOI]

Ralf Borndörfer

Math. Program., 2000

A Semidefinite Programming Approach to the Quadratic Knapsack Problem.

[BibT_eX]

[DOI]

Christoph Helmberg

Franz Rendl

J. Comb. Optim., 2000

1999

An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.

[BibT_eX]

[DOI]

Andreas S. Schulz

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

The Sequential Knapsack Polytope.

[BibT_eX]

[DOI]

Yves Pochet

SIAM J. Optim., 1998

The node capacitated graph partitioning problem: A computational study.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1998

Test sets of integer programs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1998

The Intersection of Knapsack Polyhedra and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

A Variant of the Buchberger Algorithm for Integer Programming.

[BibT_eX]

[DOI]

Regina Urbaniak

Günter M. Ziegler

SIAM J. Discret. Math., 1997

On the 0/1 knapsack polytope.

[BibT_eX]

[DOI]

Math. Program., 1997

The Steiner tree packing problem in VLSI design.

[BibT_eX]

[DOI]

Math. Program., 1997

Book reviews.

[BibT_eX]

[DOI]

Peter Brucker

Math. Methods Oper. Res., 1997

Truncated Gröbner Bases for Integer Programming.

[BibT_eX]

[DOI]

Rekha R. Thomas

Appl. Algebra Eng. Commun. Comput., 1997

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

Decomposition of Integer Programs and of Generating Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Solving Multiple Knapsack Problems by Cutting Planes.

[BibT_eX]

[DOI]

Carlos E. Ferreira

SIAM J. Optim., 1996

Packing Steiner Trees: Separation Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.

[BibT_eX]

[DOI]

Math. Program., 1996

Packing Steiner trees: polyhedral investigations.

[BibT_eX]

[DOI]

Math. Program., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Math. Program., 1996

Hilbert Bases and the Facets of Special Knapsack Polytopes.

[BibT_eX]

[DOI]

Math. Oper. Res., 1996

Packing Steiner Trees: Further Facets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Test Sets and Inequalities for Integer Programs.

[BibT_eX]

[DOI]

Rekha R. Thomas

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Quadratic Knapsack Relaxations Using Cutting Planes.

[BibT_eX]

[DOI]

Christoph Helmberg

Franz Rendl

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Routing in grid graphs by cutting planes.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

0/1-Integer Programming: Optimization and Augmentation are Equivalent.

[BibT_eX]

[DOI]

Andreas S. Schulz

Günter M. Ziegler

Proceedings of the Algorithms, 1995

1994

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

[BibT_eX]

[DOI]

Math. Program., 1994

1993

Some integer programs arising in the design of main frame computers.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

1992

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

[BibT_eX]

[DOI]