| 2008 |
|---|
| 48 | EE | Markus Durzinsky,
Annegret Wagler,
Robert Weismantel:
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
CMSB 2008: 328-346 |
| 47 | EE | Markus Durzinsky,
Annegret Wagler,
Robert Weismantel,
Wolfgang Marwan:
Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosystems 93(3): 181-190 (2008) |
| 46 | EE | Jon Lee,
Shmuel Onn,
Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System
CoRR abs/0805.0954: (2008) |
| 45 | EE | Eckart Mayer,
Utz-Uwe Haus,
Jörg Raisch,
Robert Weismantel:
Throughput-Optimal Sequences for Cyclically Operated Plants.
Discrete Event Dynamic Systems 18(3): 355-383 (2008) |
| 44 | EE | Jesús A. De Loera,
Raymond Hemmecke,
Shmuel Onn,
Robert Weismantel:
N-fold integer programming.
Discrete Optimization 5(2): 231-241 (2008) |
| 43 | EE | Matthias Köppe,
Quentin Louveaux,
Robert Weismantel:
Intermediate integer programming representations using value disjunctions.
Discrete Optimization 5(2): 293-313 (2008) |
| 42 | EE | Quentin Louveaux,
Robert Weismantel:
Polyhedral properties for the intersection of two knapsacks.
Math. Program. 113(1): 15-37 (2008) |
| 41 | EE | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program. 115(2): 273-290 (2008) |
| 40 | EE | Jon Lee,
Shmuel Onn,
Robert Weismantel:
On test sets for nonlinear integer maximization.
Oper. Res. Lett. 36(4): 439-443 (2008) |
| 39 | EE | Kent Andersen,
Quentin Louveaux,
Robert Weismantel:
Certificates of linear mixed integer infeasibility.
Oper. Res. Lett. 36(6): 734-738 (2008) |
| 38 | EE | Yael Berstein,
Jon Lee,
Hugo Maruri-Aguilar,
Shmuel Onn,
Eva Riccomagno,
Robert Weismantel,
Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design.
SIAM J. Discrete Math. 22(3): 901-919 (2008) |
| 2007 |
|---|
| 37 | EE | Kent Andersen,
Quentin Louveaux,
Robert Weismantel,
Laurence A. Wolsey:
Inequalities from Two Rows of a Simplex Tableau.
IPCO 2007: 1-15 |
| 2006 |
|---|
| 36 | EE | Jesús A. De Loera,
Raymond Hemmecke,
Matthias Köppe,
Robert Weismantel:
FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
SODA 2006: 743-748 |
| 35 | EE | Matthias Jach,
Matthias Köppe,
Robert Weismantel:
Nondecomposable solutions to group equations and an application to polyhedral combinatorics.
4OR 4(1): 29-46 (2006) |
| 34 | EE | Dennis Michaels,
Robert Weismantel:
Polyhedra related to integer-convex polynomial systems.
Math. Program. 105(2-3): 215-232 (2006) |
| 33 | EE | Claudio Gentile,
Paolo Ventura,
Robert Weismantel:
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.
SIAM J. Discrete Math. 20(4): 913-919 (2006) |
| 2004 |
|---|
| 32 | EE | Matthias Köppe,
Quentin Louveaux,
Robert Weismantel,
Laurence A. Wolsey:
Extended formulations for Gomory Corner polyhedra.
Discrete Optimization 1(2): 141-165 (2004) |
| 31 | EE | Matthias Köppe,
Robert Weismantel:
Cutting planes from a mixed integer Farkas lemma.
Oper. Res. Lett. 32(3): 207-211 (2004) |
| 30 | EE | Kazuo Murota,
Hiroo Saito,
Robert Weismantel:
Optimality criterion for a class of nonlinear integer programs.
Oper. Res. Lett. 32(5): 468-472 (2004) |
| 2003 |
|---|
| 29 | EE | Utz-Uwe Haus,
Matthias Köppe,
Robert Weismantel:
A primal all-integer algorithm based on irreducible solutions.
Math. Program. 96(2): 205-246 (2003) |
| 2002 |
|---|
| 28 | EE | Claudio Gentile,
Utz-Uwe Haus,
Matthias Köppe,
Giovanni Rinaldi,
Robert Weismantel:
A Primal Approach to the Stable Set Problem.
ESA 2002: 525-537 |
| 27 | EE | Bianca Spille,
Robert Weismantel:
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms.
IPCO 2002: 9-20 |
| 26 | EE | Martin Henk,
Robert Weismantel:
Diophantine Approximations and Integer Points of Cones.
Combinatorica 22(3): 401-408 (2002) |
| 25 | | Hugues Marchand,
Alexander Martin,
Robert Weismantel,
Laurence A. Wolsey:
Cutting planes in integer and mixed integer programming.
Discrete Applied Mathematics 123(1-3): 397-446 (2002) |
| 24 | | Karen Aardal,
Robert Weismantel,
Laurence A. Wolsey:
Non-standard approaches to integer programming.
Discrete Applied Mathematics 123(1-3): 5-74 (2002) |
| 23 | EE | Andreas S. Schulz,
Robert Weismantel:
The Complexity of Generic Primal Algorithms for Solving General Integer Programs.
Math. Oper. Res. 27(4): 681-692 (2002) |
| 2001 |
|---|
| 22 | EE | Robert T. Firla,
Bianca Spille,
Robert Weismantel:
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.
Combinatorial Optimization 2001: 48-63 |
| 21 | | Ralf Borndörfer,
Robert Weismantel:
Discrete relaxations of combinatorial programs.
Discrete Applied Mathematics 112(1-3): 11-26 (2001) |
| 2000 |
|---|
| 20 | | Christoph Helmberg,
Franz Rendl,
Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem.
J. Comb. Optim. 4(2): 197-215 (2000) |
| 1999 |
|---|
| 19 | EE | Andreas S. Schulz,
Robert Weismantel:
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
SODA 1999: 967-968 |
| 1998 |
|---|
| 18 | EE | Alexander Martin,
Robert Weismantel:
The Intersection of Knapsack Polyhedra and Extensions.
IPCO 1998: 243-256 |
| 17 | | Carlos Eduardo Ferreira,
Alexander Martin,
C. Carvalho de Souza,
Robert Weismantel,
Laurence A. Wolsey:
The node capacitated graph partitioning problem: A computational study.
Math. Program. 81: 229-256 (1998) |
| 1997 |
|---|
| 16 | | Martin Henk,
Robert Weismantel:
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.
ESA 1997: 271-283 |
| 15 | | Gérard Cornuéjols,
Regina Urbaniak,
Robert Weismantel,
Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets.
ESA 1997: 92-102 |
| 14 | EE | Rekha R. Thomas,
Robert Weismantel:
Truncated Gröbner Bases for Integer Programming.
Appl. Algebra Eng. Commun. Comput. 8(4): 241-256 (1997) |
| 13 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
The Steiner tree packing problem in VLSI design.
Math. Program. 77: 265-281 (1997) |
| 12 | | Robert Weismantel:
On the 0/1 knapsack polytope.
Math. Program. 77: 49-68 (1997) |
| 11 | EE | Regina Urbaniak,
Robert Weismantel,
Günter M. Ziegler:
A Variant of the Buchberger Algorithm for Integer Programming.
SIAM J. Discrete Math. 10(1): 96-108 (1997) |
| 1996 |
|---|
| 10 | | Rekha R. Thomas,
Robert Weismantel:
Test Sets and Inequalities for Integer Programs.
IPCO 1996: 16-30 |
| 9 | | Christoph Helmberg,
Franz Rendl,
Robert Weismantel:
Quadratic Knapsack Relaxations Using Cutting Planes.
IPCO 1996: 175-189 |
| 8 | EE | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner Trees: Further Facets.
Eur. J. Comb. 17(1): 39-52 (1996) |
| 7 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner trees: polyhedral investigations.
Math. Program. 72: 101-123 (1996) |
| 6 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner trees: a cutting plane algorithm and computational results.
Math. Program. 72: 125-145 (1996) |
| 5 | | Carlos Eduardo Ferreira,
Alexander Martin,
C. Carvalho de Souza,
Robert Weismantel,
Laurence A. Wolsey:
Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program. 74: 247-266 (1996) |
| 4 | EE | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner Trees: Separation Algorithms.
SIAM J. Discrete Math. 9(2): 233-257 (1996) |
| 1995 |
|---|
| 3 | | Andreas S. Schulz,
Robert Weismantel,
Günter M. Ziegler:
0/1-Integer Programming: Optimization and Augmentation are Equivalent.
ESA 1995: 473-483 |
| 1994 |
|---|
| 2 | | Michael Jünger,
Alexander Martin,
Gerhard Reinelt,
Robert Weismantel:
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program. 63: 257-279 (1994) |
| 1993 |
|---|
| 1 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Routing in grid graphs by cutting planes.
IPCO 1993: 447-461 |
