V. Baldoni, N. Berline, R. Hemmecke, M. Vergne, R. Weismantel, ...
2 A dramatic, yet false, ending 3 An excursion to the integer case 4 Back to the problem of integration 5 Brion’s formula 6 The polynomial Waring problem 7 Algorithmic generalization of Brion’s...
Synthesis of Reo Circuits for Implementation of Component-Connector automata specifications. (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, S. Abiteboul, R. Agrawal, ...
Note that many of these publications are available electronically at
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
cwi.nl/CWIreports/PNA/PNA-E0421.pdf. (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, S. Abiteboul, R. Agrawal, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
[10] Eric K.Y. Ho Arno J. Knobbe. Numbers in Multi-Relational Data Mining. In Knowledge (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, S. Abiteboul, R. Agrawal, ...
Note that many of these publications are available electronically at
Quentin Louveaux, K. Aardal, B. Fortz, Y. Nesterov, ...
There are many people I would like to thank who helped me achieve this longterm work. First of all, I would like to thank my supervisor Laurence Wolsey. He has always been remarkably open and...
Cutting Planes Routing in Grid Graphs by Cutting Planes (2008)
Martin Grötschel, Alexander Martin, Robert Weismantel, M. Grötschel, A. Martin, R. Weismantel
In this paper we study the following problem, which we call the weighted routing problem. Let be given a graph G = (V, E) with non-negative edge weights we € R+ and integer edge capacities ce 6 IN...
On the Way to Perfection: Primal Operations for Stable Sets in Graphs (2008)
C. Gentile, G. Rinaldi, R. Weismantel
Manfred Padberg is the scientific father, or the scientific grandfather, or the scientific great grandfather of each of the five authors. This paper is dedicated to him on the occasion of his 60th...
Global analysis of combined reaction distillation processes (2008)
Gangadwala, J., Haus, U. U., Jach, M., Kienle, A., Michaels, D., Weismantel, R.
Convex Integer Maximization via Graver Bases (2008)
J. A. De, Loera R. Hemmecke, S. Onn, U. G. Rothblum, R. Weismantel
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R d and w1x,..., wdx are linear forms on R n, max...
On the Way to Perfection: Primal Operations for Stable Sets in Graphs C. Gentile (2007)
Manfred Padberg is the scientific father, or the scientific grandfather, or the scientific great grandfather of each of the five authors. This paper is dedicated to him on the occasion of his 60th...
Optimum Path Packing on Wheels: The Noncrossing Case (2007)
M. Grotschel, A. Martin, R. Weismantel
We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a...
Facets for the Multiple Knapsack Problem (2007)
C. E. Ferreira, A. Martin, R. Weismantel
In this paper we consider the multiple knapsack problem which is defined as follows: given a set N of items with weights f i, i 2 N, a set M of knapsacks with capacities F k, k 2 M, and a profit...
C. E. Ferreira, M. Grotschel, S. Kiefl, L. Krispenz, A. Martin, R. Weismantel
In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip...
Michaels, D., Seidel-Morgenstern, A., Weismantel, R.
This paper introduces an exact mathematical approach based on combinatorial optimization to analyze continuous linear countercurrent chromatographic processes. The analysis is based on a given set of...
A logical model provides insights into T cell receptor signaling (2007)
Saez-Rodriguez, J., Simeoni, L., Lindquist, J., Hemenway, R., Bommhardt, U., Arndt, B., ...
Cellular decisions are determined by complex molecular interaction networks. Large-scale signaling networks are currently being reconstructed, but the kinetic parameters and quantitative data that...
A logical model provides insights into T cell receptor signaling (2007)
Saez-Rodriguez, J., Simeoni, L., Lindquist, J., Hemenway, R., Bommhardt, U., Arndt, B., ...
Cellular decisions are determined by complex molecular interaction networks. Large-scale signaling networks are currently being reconstructed, but the kinetic parameters and quantitative data that...
Convex Integer Maximization via Graver Bases (2006)
De Loera, J., Hemmecke, R., Onn, S., Rothblum, U. G., Weismantel, R.
We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where $c$ is a convex function on $R^d$ and $w_1x,...,w_dx$ are linear forms...
Global Bounds on Optimal Solutions for the Production of 2,3 Dimethylbutene-1 (2006)
Gangadwala, J., Kienle, A., Haus, U. U., Michaels, D., Weismantel, R.
This paper is concerned with computer-aided optimal design of combined reaction-distillation processes. The production of solvent 2,3-dimethylbutene-1 by isomerization of 2,3-dimethylbutene-2 is...
Global bounds on optimal solutions in chemical process design (2006)
Haus, U. U., Gangadwala, J., Kienle, A., Michaels, D., Seidel-Morgenstern, A., Weismantel, R.
In this paper a new approach for computing global bounds on optimal solutions of mixed-integer nonlinear programs is presented. These type of problems frequently arise in optimal design of chemical...
Optimal Process Design for the Synthesis of 2,3-Dimethylbutene-1 (2005)
Gangadwala, J., Kienle, A., Michaels, D., Weismantel, R.
This paper is concerned with the computer-aided optimal design of reaction-distillation processes. The production of solvent 2,3-dimethylbutene-1 by isomerization of 2,3-dimethylbutene-2 is...
Extended Formulations for Gomory Corner Polyhedra (2004)
Q. Louveaux, R. Weismantel, L. Wolsey
Abstract We present several types of extended formulations for integer programs, based on irreducible integer solutions to Gomory's group relaxations. We present an algorithm based on an...
A Semidefinite Programming Approach to the Quadratic Knapsack Problem (2000)
C. Helmberg, F. Rendl, R. Weismantel
In order to gain insight into the quality of semidefinite relaxations of constrained quadratic 0/1 programming problems we study the quadratic knapsack problem. We investigate several basic...
On the 0/1 knapsack polytope (1997)
In this paper we describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are...
The Steiner Tree Packing Problem in VLSI-Design (1997)
M. Grötschel, A. Martin, R. Weismantel
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus...
Polyhedral combinatorics: An annotated bibliography (1996)
Polyhedral combinatorics is the study of the integer programming polyhedron P = conv(X) = conv(fx 2 Xg); where X is given as a subset of the integer lattice Z Z n and conv denotes the convex hull...
The Node Capacitated Graph Partitioning Problem: A Computational Study (1996)
C. E. Ferreira, A. Martin, R. Weismantel, L.A. Wolsey
In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing...
Packing Steiner trees: further facets (1996)
M. Grötschel, A. Martin, R. Weismantel
In this paper we continue the investigations in [GMW92a] for the Steiner tree packing polyhedron. We present several new classes of valid inequalities and give sufficient (and necessary) conditions...
A Semidefinite Programming Approach to the Quadratic Knapsack Problem (1996)
Christoph Helmberg, Franz Rendl, Robert Weismantel, C. Helmberg, F. Rendl, R. Weismantel
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in...
Christoph Helmberg, Franz Rendl, Robert Weismantel, C. Helmberg, F. Rendl, ...
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in...
Quadratic Knapsack Relaxations Using Cutting Planes and Semidefinite Programming (1995)
Christoph Helmberg, Franz Rendl, Robert Weismantel, C. Helmberg, F. Rendl, R. Weismantel
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in...
Optimum Path Packing on Wheels: The Consecutive Case (1995)
Martin Grötschel, Alexander Martin, Robert Weismantel, M. Grotschel, A. Martin, R. Weismantel
We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that the terminal pairs are in consecutive order, then a path packing, i....
M. Jünger, A. Martin, G. Reinelt, R. Weismantel
The placement problem in the layout design of electronic circuits consists of finding a nonoverlapping assignment of rectangular cells to positions on the chip so that wireability is guaranteed and...
A Cutting Plane Based Algorithm for the Multiple Knapsack Problem (1993)
C. E. Ferreira, A. Martin, R. Weismantel
In this paper we describe a cutting plane based algorithm for the multiple knapsack problem. We use our algorithm to solve some practical problem instances arising in the layout of electronic...
Packing Paths and Steiner Trees: Routing of Electronic Circuits (1993)
One of the challenging problems in the design of electronic circuits is the so-called routing problem. Roughly speaking, the task is to connect so-called terminal sets via wires on a predefined area....
Packing Steiner trees: separation algorithms (1993)
M. Grötschel, A. Martin, R. Weismantel
In this paper we investigate separation problems for classes of inequalities valid for the polytope associated with the Steiner tree packing problem, a problem that arises, e. g., in VLSI routing....
Some Integer Programs Arising in the Design of Main Frame Computers (1992)
C. E. Ferreira, M. Grötschel, S. Kiefl, L. Krispenz, A. Martin, R. Weismantel
In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip...
Packing Steiner Trees: A Cutting Plane Algorithm and Computational Results (1992)
M. Grötschel, A. Martin, R. Weismantel
In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational...
Packing Steiner trees: polyhedral investigations (1992)
M. Grötschel, A. Martin, R. Weismantel
Let G = (V; E) be a graph and T ` V be a node set. We call an edge set S a Steiner tree with respect to T if S connects all pairs of nodes in T. In this paper we address the following problem, which...
Evaluating the Feasibility of SMB Chromatography for Reduced Efficiency and Purity Requirements
Michaels, D., Seidel-Morgenstern, A., Weismantel, R.
In the last years the simulated moving bed technology has proven to be a powerful concept to separate isomers, in particular enantiomers. Due to the complex multicolumn arrangement, the design and...
Structural analysis of the signaling network governing T-cell activation
Saez-Rodriguez, J., Hemenway, R., Lindquist, J., Simeoni, L., Klamt, S., Haus, U., ...
T-cells are able to distinguish foreign antigens among the myriads of self-antigens presented in our body, and organize a directed response against them. While the central sensor for this recognition...
Non-Standard Approaches to Integer Programming.
Aardal, K., Weismantel, R., Wosley, L.
In this survey we address three of the principle algebraic approaches to integer programming. After introducing lattices and basis reduction, we first survey their use in integer programming,...
Cutting Planes in Integer and Mixed Integer Programming.
Marchand, H., Martin, A., Weismantel, R., Wolsey, L.
This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for i) general integer programs, ii) problems with local structure such...