default search action
Robert Weismantel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j98]Marcel Celaya, Stefan Kuhlmann, Joseph Paat
, Robert Weismantel:
Proximity and Flatness Bounds for Linear Integer Optimization. Math. Oper. Res. 49(4): 2446-2467 (2024) - [j97]Timm Oertel, Joseph Paat
A colorful Steinitz Lemma with application to block-structured integer programs. Math. Program. 204(1): 677-702 (2024) - [c32]Marcel Celaya, Stefan Kuhlmann, Robert Weismantel:
On Matrices over a Polynomial Ring with Restricted Subdeterminants. IPCO 2024: 43-56 - [i17]Stefan Kuhlmann, Timm Oertel, Robert Weismantel:
Sparse Approximation in Lattices and Semigroups. CoRR abs/2410.23990 (2024) - 2023
- [j96]Christoph Hunkenschröder
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube. SIAM J. Optim. 33(2): 538-552 (2023) - [c31]Sabrina Bruckmeier
Sparse Approximation over the Cube. IPCO 2023: 44-57 - [i16]Marcel Celaya, Stefan Kuhlmann, Robert Weismantel:
On Matrices over a Polynomial Ring with Restricted Subdeterminants. CoRR abs/2311.03845 (2023) - 2022
- [j95]Joseph Paat
The integrality number of an integer program. Math. Program. 192(1): 271-291 (2022) - [j94]Martin Henk, Stefan Kuhlmann, Robert Weismantel:
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. SIAM J. Discret. Math. 36(3): 1918-1942 (2022) - [c30]Marcel Celaya
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. IPCO 2022: 84-97 - [i15]Christoph Hunkenschröder, Sebastian Pokutta, Robert Weismantel:
Optimizing a low-dimensional convex function over a high-dimensional cube. CoRR abs/2204.05266 (2022) - [i14]Miriam Schlöter, Robert Weismantel:
Minimum-Cost Flows Over Time. CoRR abs/2206.00526 (2022) - [i13]Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel:
Sparse Approximation Over the Cube. CoRR abs/2210.02738 (2022) - 2021
- [c29]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14 - [c28]Christoph Glanzer, Ingo Stallknecht, Robert Weismantel:
On the Recognition of a, b, c-Modular Matrices. IPCO 2021: 238-251 - [c27]Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA 2021: 1666-1681 - [i12]Christoph Glanzer, Ingo Stallknecht, Robert Weismantel:
Notes on {a, b, c}-Modular Matrices. CoRR abs/2106.14980 (2021) - 2020
- [j93]Joseph Paat, Robert Weismantel, Stefan Weltge
Distances between optimal solutions of mixed-integer programs. Math. Program. 179(1): 455-468 (2020) - [j92]Timm Oertel, Joseph Paat, Robert Weismantel:
The Distributions of Functions Related to Parametric Integer Optimization. SIAM J. Appl. Algebra Geom. 4(3): 422-440 (2020) - [j91]Alberto Del Pia
Subset Selection in Sparse Matrices. SIAM J. Optim. 30(2): 1173-1190 (2020) - [j90]Friedrich Eisenbrand, Robert Weismantel:
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Trans. Algorithms 16(1): 5:1-5:14 (2020) - [c26]Joseph Paat, Miriam Schlöter, Robert Weismantel:
The Integrality Number of an Integer Program. IPCO 2020: 338-350 - [i11]Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel:
N-fold integer programming via LP rounding. CoRR abs/2002.07745 (2020) - [i10]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR abs/2012.11742 (2020)
2010 – 2019
- 2019
- [c25]Timm Oertel
Sparsity of Integer Solutions in the Average Case. IPCO 2019: 341-353 - [i9]Joseph Paat, Miriam Schlöter, Robert Weismantel:
Most IPs with bounded determinants can be solved in polynomial time. CoRR abs/1904.06874 (2019) - 2018
- [j89]Jörg Bader, Robert Hildebrand
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. 169(2): 565-584 (2018) - [j88]Christoph Glanzer, Robert Weismantel, Rico Zenklusen:
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. SIAM J. Discret. Math. 32(3): 1706-1720 (2018) - [j87]Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel
The Support of Integer Optimal Solutions. SIAM J. Optim. 28(3): 2152-2157 (2018) - [c24]Friedrich Eisenbrand, Robert Weismantel:
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. SODA 2018: 808-816 - [i8]Alberto Del Pia, Santanu S. Dey, Robert Weismantel:
Subset selection in sparse matrices. CoRR abs/1810.02757 (2018) - 2017
- [j86]Amitabh Basu
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6): 671-674 (2017) - [c23]Robert Hildebrand, Robert Weismantel, Rico Zenklusen:
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA 2017: 2342-2350 - [c22]Stephan Artmann, Robert Weismantel, Rico Zenklusen:
A strongly polynomial algorithm for bimodular integer linear programming. STOC 2017: 1206-1219 - [i7]Friedrich Eisenbrand, Robert Weismantel:
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. CoRR abs/1707.00481 (2017) - 2016
- [j85]Alberto Del Pia
Relaxations of mixed integer sets from lattice-free polyhedra. Ann. Oper. Res. 240(1): 95-117 (2016) - [j84]Alberto Del Pia
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane. Math. Oper. Res. 41(2): 511-530 (2016) - [j83]Michel Baes, Timm Oertel
Duality for mixed-integer convex minimization. Math. Program. 158(1-2): 547-564 (2016) - [j82]Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel
A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5): 635-639 (2016) - [c21]Robert Hildebrand
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. SODA 2016: 1715-1723 - 2015
- [j81]Robert Hildebrand, Timm Oertel
Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43(3): 279-282 (2015) - [j80]David Adjiashvili, Timm Oertel
A Polyhedral Frobenius Theorem with Applications to Integer Optimization. SIAM J. Discret. Math. 29(3): 1287-1302 (2015) - 2014
- [j79]Raymond Hemmecke, Matthias Köppe
Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Program. 145(1-2): 1-18 (2014) - [j78]Timm Oertel
Integer convex minimization by mixed integer linear optimization. Oper. Res. Lett. 42(6-7): 424-428 (2014) - [c20]David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen:
Time-Expanded Packings. ICALP (1) 2014: 64-76 - [c19]Alberto Del Pia
Integer quadratic programming in the plane. SODA 2014: 840-846 - 2012
- [j77]Alberto Del Pia
Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3): 221-244 (2012) - [j76]Michel Baes, Alberto Del Pia
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. 134(1): 305-322 (2012) - [j75]Yusuke Kobayashi, Kazuo Murota, Robert Weismantel:
Cone superadditivity of discrete convex functions. Math. Program. 135(1-2): 25-44 (2012) - [j74]Alberto Del Pia
On convergence in mixed integer programming. Math. Program. 135(1-2): 397-412 (2012) - [j73]Jon Lee
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136(2): 301-323 (2012) - 2011
- [j72]Steffen Borchers, Sandro Bosio, Rolf Findeisen
Graph problems arising from parameter identification of discrete dynamical systems. Math. Methods Oper. Res. 73(3): 381-400 (2011) - [j71]Gennadiy Averkov, Christian Wagner, Robert Weismantel:
Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. Math. Oper. Res. 36(4): 721-742 (2011) - [j70]Raymond Hemmecke, Shmuel Onn
A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126(1): 97-117 (2011) - [j69]Wolfgang Marwan, Annegret Wagler, Robert Weismantel:
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks. Nat. Comput. 10(2): 639-654 (2011) - [j68]Annegret Wagler, Robert Weismantel:
The combinatorics of modeling and analyzing biological systems. Nat. Comput. 10(2): 655-681 (2011) - [j67]Raymond Hemmecke, Shmuel Onn
N-fold integer programming and nonlinear multi-transshipment. Optim. Lett. 5(1): 13-25 (2011) - [j66]Alberto Del Pia
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. Oper. Res. Lett. 39(4): 234-240 (2011) - [j65]Tilo Beyer, Mandy Busse, Kroum Hristov
Integrating Signals from the T-Cell Receptor and the Interleukin-2 Receptor. PLoS Comput. Biol. 7(8) (2011) - [j64]Markus Durzinsky, Annegret Wagler, Robert Weismantel:
An algorithmic framework for network reconstruction. Theor. Comput. Sci. 412(26): 2800-2815 (2011) - 2010
- [j63]Philipp Rumschinski
Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks. BMC Syst. Biol. 4: 69 (2010) - [j62]Martin Ballerstein, Dennis Michaels, Andreas Seidel-Morgenstern
A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points. Comput. Chem. Eng. 34(4): 447-459 (2010) - [j61]Kent Andersen, Quentin Louveaux, Robert Weismantel:
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets. Math. Oper. Res. 35(1): 233-256 (2010) - [j60]Yael Berstein, Jon Lee
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010) - [j59]Kent Andersen, Quentin Louveaux, Robert Weismantel:
Mixed-integer sets from two rows of two adjacent simplex bases. Math. Program. 124(1-2): 455-480 (2010) - [j58]Christoph Buchheim
Integer Programming Subject to Monomial Constraints. SIAM J. Optim. 20(6): 3297-3311 (2010) - [c18]Kent Andersen, Robert Weismantel:
Zero-Coefficient Cuts. IPCO 2010: 57-70 - [c17]Raymond Hemmecke, Matthias Köppe
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. IPCO 2010: 219-229 - [p2]Raymond Hemmecke, Matthias Köppe
Nonlinear Integer Programming. 50 Years of Integer Programming 2010: 561-618 - [i6]Jon Lee, Shmuel Onn, Robert Weismantel:
Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR abs/1001.5056 (2010) - [i5]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions. CoRR abs/1006.0773 (2010)
2000 – 2009
- 2009
- [j57]Utz-Uwe Haus, Kathrin Niermann, Klaus Truemper, Robert Weismantel:
Logic Integer Programming Models for Signaling Networks. J. Comput. Biol. 16(5): 725-743 (2009) - [j56]Utz-Uwe Haus, Klaus Truemper, Robert Weismantel:
Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. J. Satisf. Boolean Model. Comput. 6(1-3): 13-32 (2009) - [j55]Jon Lee
Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. 23(4): 1667-1681 (2009) - [j54]Kent Andersen, Christian Wagner, Robert Weismantel:
On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows. SIAM J. Optim. 20(2): 967-982 (2009) - [c16]Jon Lee
Nonlinear Optimization over a Weighted Independence System. AAIM 2009: 251-264 - [c15]Steffen Borchers, Philipp Rumschinski
A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems. CDC 2009: 6786-6792 - [i4]Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
Multicommodity Flow in Polynomial Time. CoRR abs/0906.5106 (2009) - 2008
- [j53]Markus Durzinsky, Annegret Wagler, Robert Weismantel, Wolfgang Marwan:
Automatic reconstruction of molecular and genetic networks from discrete time series data. Biosyst. 93(3): 181-190 (2008) - [j52]Jignesh Gangadwala, Utz-Uwe Haus, Matthias Jach, Achim Kienle
Global analysis of combined reaction distillation processes. Comput. Chem. Eng. 32(1-2): 343-355 (2008) - [j51]Eckart Mayer, Utz-Uwe Haus, Jörg Raisch, Robert Weismantel:
Throughput-Optimal Sequences for Cyclically Operated Plants. Discret. Event Dyn. Syst. 18(3): 355-383 (2008) - [j50]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn
N-fold integer programming. Discret. Optim. 5(2): 231-241 (2008) - [j49]Matthias Köppe
Intermediate integer programming representations using value disjunctions. Discret. Optim. 5(2): 293-313 (2008) - [j48]Wolfgang Marwan, Annegret Wagler, Robert Weismantel:
A mathematical approach to solve the network reconstruction problem. Math. Methods Oper. Res. 67(1): 117-132 (2008) - [j47]Quentin Louveaux, Robert Weismantel:
Polyhedral properties for the intersection of two knapsacks. Math. Program. 113(1): 15-37 (2008) - [j46]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. Math. Program. 115(2): 273-290 (2008) - [j45]Jon Lee
On test sets for nonlinear integer maximization. Oper. Res. Lett. 36(4): 439-443 (2008) - [j44]Kent Andersen, Quentin Louveaux, Robert Weismantel:
Certificates of linear mixed integer infeasibility. Oper. Res. Lett. 36(6): 734-738 (2008) - [j43]Yael Berstein, Jon Lee
Nonlinear Matroid Optimization and Experimental Design. SIAM J. Discret. Math. 22(3): 901-919 (2008) - [j42]Matthias Jach, Dennis Michaels, Robert Weismantel:
The Convex Envelope of (n--1)-Convex Functions. SIAM J. Optim. 19(3): 1451-1466 (2008) - [c14]Markus Durzinsky, Annegret Wagler, Robert Weismantel:
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. CMSB 2008: 328-346 - [i3]Jon Lee, Shmuel Onn, Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System. CoRR abs/0805.0954 (2008) - 2007
- [j41]Utz-Uwe Haus, Dennis Michaels, Andreas Seidel-Morgenstern
A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization. Comput. Chem. Eng. 31(11): 1525-1534 (2007) - [j40]Julio Saez-Rodriguez
A Logical Model Provides Insights into T Cell Receptor Signaling. PLoS Comput. Biol. 3(8) (2007) - [j39]Raymond Hemmecke, Robert Weismantel:
Representation of Sets of Lattice Points. SIAM J. Optim. 18(1): 133-137 (2007) - [c13]Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
Inequalities from Two Rows of a Simplex Tableau. IPCO 2007: 1-15 - [i2]Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design. CoRR abs/0707.4618 (2007) - 2006
- [j38]Matthias Jach, Matthias Köppe
Nondecomposable solutions to group equations and an application to polyhedral combinatorics. 4OR 4(1): 29-46 (2006) - [j37]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe
Integer Polynomial Optimization in Fixed Dimension. Math. Oper. Res. 31(1): 147-153 (2006) - [j36]Dennis Michaels, Robert Weismantel:
Polyhedra related to integer-convex polynomial systems. Math. Program. 105(2-3): 215-232 (2006) - [j35]Claudio Gentile, Paolo Ventura, Robert Weismantel:
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets. SIAM J. Discret. Math. 20(4): 913-919 (2006) - [c12]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 - [i1]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-Fold Integer Programming. CoRR abs/math/0605242 (2006) - 2005
- [b2]Dimitris Bertsimas, Robert Weismantel:
Optimization over integers. Athena Scientific 2005, ISBN 978-0-97591-462-5, pp. I-X, 1-602 - 2004
- [j34]Matthias Köppe
Extended formulations for Gomory Corner polyhedra. Discret. Optim. 1(2): 141-165 (2004) - [j33]Matthias Köppe
Cutting planes from a mixed integer Farkas lemma. Oper. Res. Lett. 32(3): 207-211 (2004) - [j32]Kazuo Murota, Hiroo Saito, Robert Weismantel:
Optimality criterion for a class of nonlinear integer programs. Oper. Res. Lett. 32(5): 468-472 (2004) - [p1]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe
On the Way to Perfection: Primal Operations for Stable Sets in Graphs. The Sharpest Cut 2004: 51-76 - 2003
- [j31]Martin Henk, Matthias Köppe
Integral decomposition of polyhedra and some applications in mixed integer programming. Math. Program. 94(2-3): 193-206 (2003) - [j30]Utz-Uwe Haus, Matthias Köppe
A primal all-integer algorithm based on irreducible solutions. Math. Program. 96(2): 205-246 (2003) - [j29]Matthias Köppe
An algorithm for mixed integer optimization. Math. Program. 98(1-3): 281-307 (2003) - 2002
- [j28]Martin Henk
Diophantine Approximations and Integer Points of Cones. Comb. 22(3): 401-408 (2002) - [j27]Karen I. Aardal, Robert Weismantel, Laurence A. Wolsey:
Non-standard approaches to integer programming. Discret. Appl. Math. 123(1-3): 5-74 (2002) - [j26]Hugues Marchand, Alexander Martin
Cutting planes in integer and mixed integer programming. Discret. Appl. Math. 123(1-3): 397-446 (2002) - [j25]Michael Jünger, Rüdiger Schultz, Robert Weismantel:
Preface. Math. Methods Oper. Res. 56(1): 1-2 (2002) - [j24]Robert T. Firla, Bianca Spille, Robert Weismantel:
Exponential irreducible neighborhoods for combinatorial optimization problems. Math. Methods Oper. Res. 56(1): 29-44 (2002) - [j23]Andreas S. Schulz, Robert Weismantel:
The Complexity of Generic Primal Algorithms for Solving General Integer Programs. Math. Oper. Res. 27(4): 681-692 (2002) - [c11]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe
A Primal Approach to the Stable Set Problem. ESA 2002: 525-537 - [c10]Bianca Spille, Robert Weismantel:
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. IPCO 2002: 9-20 - 2001
- [j22]Ralf Borndörfer, Robert Weismantel:
Discrete relaxations of combinatorial programs. Discret. Appl. Math. 112(1-3): 11-26 (2001) - [j21]Utz-Uwe Haus, Matthias Köppe
The integral basis method for integer programming. Math. Methods Oper. Res. 53(3): 353-361 (2001) - [c9]Robert T. Firla, Bianca Spille, Robert Weismantel:
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. Combinatorial Optimization 2001: 48-63 - 2000
- [j20]Christoph Helmberg, Franz Rendl, Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4(2): 197-215 (2000) - [j19]Ralf Borndörfer, Robert Weismantel:
Set packing relaxations of some integer programs. Math. Program. 88(3): 425-450 (2000)
1990 – 1999
- 1999
- [c8]Andreas S. Schulz, Robert Weismantel:
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. SODA 1999: 967-968 - 1998
- [j18]Robert Weismantel:
Test sets of integer programs. Math. Methods Oper. Res. 47(1): 1-37 (1998) - [j17]Carlos Eduardo Ferreira, Alexander Martin
The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998) - [j16]Yves Pochet, Robert Weismantel:
The Sequential Knapsack Polytope. SIAM J. Optim. 8(1): 248-264 (1998) - [c7]Alexander Martin
The Intersection of Knapsack Polyhedra and Extensions. IPCO 1998: 243-256 - 1997
- [j15]Rekha R. Thomas, Robert Weismantel:
Truncated Gröbner Bases for Integer Programming. Appl. Algebra Eng. Commun. Comput. 8(4): 241-256 (1997) - [j14]Shmuel Onn, Robert Weismantel, Peter Brucker:
Book reviews. Math. Methods Oper. Res. 46(2): 281-284 (1997) - [j13]Robert Weismantel:
On the 0/1 knapsack polytope. Math. Program. 77: 49-68 (1997) - [j12]Martin Grötschel, Alexander Martin
The Steiner tree packing problem in VLSI design. Math. Program. 77: 265-281 (1997) - [j11]Regina Urbaniak, Robert Weismantel, Günter M. Ziegler:
A Variant of the Buchberger Algorithm for Integer Programming. SIAM J. Discret. Math. 10(1): 96-108 (1997) - [c6]Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102 - [c5]Martin Henk, Robert Weismantel:
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. ESA 1997: 271-283 - 1996
- [j10]Martin Grötschel, Alexander Martin
Packing Steiner Trees: Further Facets. Eur. J. Comb. 17(1): 39-52 (1996) - [j9]Robert Weismantel:
Hilbert Bases and the Facets of Special Knapsack Polytopes. Math. Oper. Res. 21(4): 886-904 (1996) - [j8]Martin Grötschel, Alexander Martin
Packing Steiner trees: polyhedral investigations. Math. Program. 72: 101-123 (1996) - [j7]Martin Grötschel, Alexander Martin
Packing Steiner trees: a cutting plane algorithm and computational results. Math. Program. 72: 125-145 (1996) - [j6]Carlos Eduardo Ferreira, Alexander Martin
Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996) - [j5]Martin Grötschel, Alexander Martin
Packing Steiner Trees: Separation Algorithms. SIAM J. Discret. Math. 9(2): 233-257 (1996) - [j4]Carlos E. Ferreira, Alexander Martin
Solving Multiple Knapsack Problems by Cutting Planes. SIAM J. Optim. 6(3): 858-877 (1996) - [c4]Rekha R. Thomas, Robert Weismantel:
Test Sets and Inequalities for Integer Programs. IPCO 1996: 16-30 - [c3]Christoph Helmberg, Franz Rendl, Robert Weismantel:
Quadratic Knapsack Relaxations Using Cutting Planes. IPCO 1996: 175-189 - 1995
- [j3]Martin Grötschel, Alexander Martin
Routing in grid graphs by cutting planes. Math. Methods Oper. Res. 41(3): 255-275 (1995) - [c2]Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler:
0/1-Integer Programming: Optimization and Augmentation are Equivalent. ESA 1995: 473-483 - 1994
- [j2]Michael Jünger, Alexander Martin
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. 63: 257-279 (1994) - 1993
- [j1]Carlos E. Ferreira, Martin Grötschel, Alexander Martin
Some integer programs arising in the design of main frame computers. ZOR Methods Model. Oper. Res. 38(1): 77-100 (1993) - [c1]Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. IPCO 1993: 447-461 - 1992
- [b1]Robert Weismantel:
Plazieren von Zellen: Theorie und Lösung eines quadratischen 0/1-Optimierungsproblems. Technical University of Berlin, Germany, 1992, pp. 1-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 19:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: