Prof. Dr. Robert Weismantel

Publications

 
 
The following list of publications covers various scientific areas:
  • polyhedral combinatorics,
  • theory of integer programming with connections to algorithmic algebra and discrete geometry,
  • combinatorial and integer algorithms with connections to theoretical computer science,
  • application of optimization to engineering and biology.

 

Articles in international Journals

  1. M. Jünger, A. Martin, G. Reinelt, R. Weismantel: Simultaneous placement in the sea of gates layout style, Methods of Operations Research 62, 1989, 275 — 278.
  2. C.E. Ferreira, M. Grötschel, S. Kiefl, L. Krispenz, A. Martin, R. Weismantel: Some integer programs arising in the design of mainframe computers, ZOR — Methods and Models of Operations Research 38, 1993, 77 — 100.
  3. A. Martin, R. Weismantel: Packing paths and Steiner trees: routing of electronic circuits, CWI Quarterly, Centrum voor Wiskunde en Informatica 6, 1993, 185 — 204.
  4. M. Jünger, A. Martin, G. Reinelt, R. Weismantel: Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits, Mathematical Programming, 1994, 257 — 279.
  5. M. Grötschel, A. Martin, R. Weismantel: Routing in grid graphs by cutting planes II, Methods and Models of Operations Research 43, 1995, 255 — 275.
  6. B. Sturmfels, R. Weismantel, G. Ziegler: Gröbner bases of lattices, corner polyhedra and integer programming, Contributions to Algebra and Geometry 36, 1995, 281 — 298.
  7. C.E. Ferreira, A. Martin, R. Weismantel: Solving multiple knapsack problems by cutting planes, SIAM Journal on Optimization 6, 1996, 858 — 877.
  8. M. Grötschel, A. Martin, R. Weismantel: Packing Steiner trees: separation algorithms, SIAM Journal on Discrete Mathematics, Vol 9, No 2, 1996, 233 — 257.
  9. M. Grötschel, A. Martin, R. Weismantel: Packing Steiner trees: further facets, European Journal on Combinatorics 17, 1996, 39 — 52.
  10. M. Grötschel, A. Martin, R. Weismantel: Packing Steiner trees: polyhedral investigations, Mathematical Programming 72, 1996, 101 — 123.
  11. M. Grötschel, A. Martin, R. Weismantel: Packing Steiner trees: a cutting plane algorithm and computational results, Mathematical Programming 72, 1996, 125 — 145.
  12. C.E. Ferreira, A. Martin, C. de Souza, R. Weismantel, L. Wolsey: Formulations and valid inequalities for the node capacitated graph partitioning problem, Mathematical Programming 74, 1996, 247 — 267.
  13. R. Weismantel: Hilbert bases and the facets of special knapsack polytopes, Mathematics of Operations Research 21, 1996, 886 — 904.
  14. M. Grötschel, A. Martin, R. Weismantel: Optimum path packing on wheels: The consecutive case, Computers and Mathematics with Applications, Vol 31, No 11, 1996, 23 — 35.
  15. R. Urbaniak, R. Weismantel, G. Ziegler: A variant of the Buchberger algorithm for integer programming, SIAM Journal on Discrete Mathematics, Vol 1, No 10, 1997, 96 — 108.
  16. R. Weismantel: On the 0/1 Knapsack polytope, Mathematical Programming 77, 1997, 49 — 68.
  17. R. Thomas, R. Weismantel: Truncated Gröbner bases for integer programming, Applicable Algebra in Engineering, Communication and Computing, Vol. 8, No. 4, 1997, 241 — 257.
  18. M. Grötschel, A. Martin, R. Weismantel: The Steiner Tree Packing Problem in VLSI-Design, Mathematical Programming 78, 1997, 265 — 282.
  19. M. Henk, R. Weismantel, The height of minimal Hilbert bases, Results in Mathematics 32, 1997, 298 — 303.
  20. Y. Pochet, R. Weismantel, The sequential knapsack polytope, SIAM Journal on Optimization 8, 1998, 248 — 264.
  21. C.E. Ferreira, A. Martin, C. de Souza, R. Weismantel, L. Wolsey, The node capacitated graph partitioning problem: a computational study, Mathematical Programming 81, 1998, 229 — 256.
  22. R. Weismantel, Test sets of integer programs, Mathematical Methods of Operations Research 47, 1998, 1 — 37.
  23. W. Bruns, J. Gubaladze. M. Henk, A. Martin, R. Weismantel, A counterexample to an integer analogue of Carathéodory's Theorem, Journal of Pure and Applied Mathematics 510, 1999, 179 — 185.
  24. M. Henk, R. Weismantel, On minimal solutions of Diophantine equations, Contributions to Algebra and Geometry 41, 2000, 49 — 55.
  25. R. Borndörfer, R. Weismantel, Set packing relaxations of some integer programs, Mathematical Programming 88, 2000, 425 — 450.
  26. C. Helmberg, F. Rendl, R. Weismantel, A Semidefinite Programming Approach to the Quadratic Knapsack Problem, Journal of Combinatorial Optimization 4, 2000, 197 — 215.
  27. R. Borndörfer, R. Weismantel, Discrete relaxations of combinatorial programs, Discrete Applied Mathematics 112, 2001, 11 — 26.
  28. U.-U. Haus, M. Köppe, R. Weismantel, The integral basis method for integer programming, Mathematical Methods in Operations Research 53 (3), 2001, 353 — 361.
  29. R. Firla, B. Spille, R. Weismantel, Exponential irreducible neighborhoods for combinatorial optimization problems, Mathematical Methods of Operations Research 56, 2002, 29 — 44.
  30. M. Henk, R. Weismantel, Diophantine approximations and integer points of cones, Combinatorica 22, 2002, 401 — 408.
  31. H. Marchand, A. Martin, R. Weismantel, L. Wolsey, Cutting Planes in Integer and Mixed Integer Programming, Discrete Applied Mathematics 123, 2002, 397 — 446.
  32. K. Aardal, R. Weismantel, L. Wolsey, Non-Standard Approaches to Integer Programming, Discrete Applied Mathematics 123, 2002, 5 — 74.
  33. A. Schulz, R. Weismantel, The complexity of generic primal algorithms for solving general integer programs, Mathematics of Operations Research 27, 2002, 681 — 692.
  34. M. Henk, M. Köppe, R. Weismantel, Integral decomposition of polyhedra and some applications in mixed integer programming, Mathematical Programming 94, 2003, 193 — 206.
  35. U.-U. Haus, M. Köppe, R. Weismantel, A primal all-integer algorithm based on irreducible solutions, Mathematical Programming 96, 2003, 205 — 246.
  36. M. Köppe, R. Weismantel, An algorithm for mixed integer optimization, Mathematical Programming 98, 2003, 281 — 308.
  37. M. Köppe, R. Weismantel, A mixed-integer Farkas Lemma and some consequences, Operations Research Letters 32, 2004, 207 — 211.
  38. K. Murota, H. Saito, R. Weismantel, Optimality criterion for a class of nonlinear integer programs, Operations Research Letters 32, 2004, 468 — 472.
  39. M. Köppe, Q. Louveaux, R. Weismantel, L. Wolsey, Extended formulations for Gomory corner polyhedra, Discrete Optimization 1, 2004, 141 — 165.
  40. D. Michaels, R. Weismantel, Polyhedra related to integer convex polynomial systems, Mathematical Programming 105, 2006, 215 — 232.
  41. R. Hemmecke, M. Köppe, J. De Loera, R. Weismantel, Integer polynomial optimization in fixed dimension, Mathematics of Operations Research 31, 2006, 147 — 153.
  42. M. Jach, M. Köppe, R. Weismantel, Nondecomposable Solutions to Group Equations and an Application to Polyhedral Combinatorics, 4OR 4/1, 2006, 29 — 46.
  43. J. Gangadwala, A. Kienle, U.-U. Haus, D. Michaels, R. Weismantel, Global Bounds on Optimal Solutions for the Production of 2,3-Dimethylbutene-1, Industrial & Engineering Chemistry Research, 2006.
  44. C. Gentile, P. Ventura, R. Weismantel, Mod-2 cuts generation yields the convex hull of bounded integer feasible sets, SIAM Journal on Discrete Mathematics 20, 2006, 913 — 919.
  45. R. Hemmecke, R. Weismantel, Representations of sets of lattice points, SIAM Journal on Optimization 18 (1), 2007, 133 — 137.
  46. U.-U. Haus, D. Michaels, A. Seidel-Morgenstern, R. Weismantel, A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization, Computers & Chemical Engineering 31 (11), 2007, 1525 — 1534.
  47. J. Saez-Rodriguez, L. Simeoni, J. Lindquist, R. Hemenway, U. Bommhardt, B. Arndt, U.-U. Haus, R. Weismantel, E.D. Gilles, S. Klamt, B. Schraven, A Comprehensive Logical Model Predicts Key Events in the T-cell Signaling Network, PLoS Computational Biology 3 (8), 2007, E163.
  48. J. Gangadwala, U.-U. Haus, M. Jach, A. Kienle, D. Michaels, R. Weismantel, Global analysis of combined reaction distillation processes, Computers & Chemical Engineering 32, 2008, 343 — 355.
  49. R. Hemmecke, J. De Loera, S. Onn, R. Weismantel, N-fold Integer Programming, Discrete Optimization 5 (2), 2008, 231 — 241.
  50. Q. Louveaux, R. Weismantel, Polyhedral properties for the intersection of two knapsacks, Mathematical Programming 113, 2008, 15 — 38.
  51. W. Marwan, A. Wagler, R. Weismantel, A mathematical approach to solve the network reconstruction problem, Mathematical Methods of Operations Research 67 (1), 2008, 117 — 132.
  52. M. Köppe, Q. Louveaux, R. Weismantel, Intermediate Integer Programming representations based on value disjunctions, Discrete Optimization 5 (2), 2008, 293 —313.
  53. R. Hemmecke, M. Köppe, J. De Loera, R. Weismantel, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, Mathematical Programming 115 (2), 2008, 273 — 290.
  54. Y. Berstein, J. Lee, S. Onn, H. Maruri, H. Wynn, E. Riccomagno, R. Weismantel, Nonlinear Matroid Optimization and Experimental Design, SIAM Journal on Discrete Mathematics 22 (3), 2008, 901 — 919.
  55. J. Lee, S. Onn, R. Weismantel, Test sets for nonlinear integer maximization, Operations Research Letters 36 (4), 2008, 439 — 443.
  56. M. Durzynski, W. Marwan, A. Wagler, R. Weismantel, Automatic Reconstruction of Molecular and Genetic Networks from Discrete Time Series Data, BioSystems 93, 2008, 181 — 190.
  57. J. De Loera, R. Hemmecke, S. Onn, U.G. Rothblum, R. Weismantel, Convex Integer Maximization via Graver Bases, Journal of Pure and Applied Algebra, 2008, to appear.
  58. U. U. Haus, E. Mayer, J. Raisch, R. Weismantel, Throughput-optimal sequences for cyclically operated plants, Discrete Event Dynamic Systems - Theory and Applications 18, 2008, 355 - 383.
  59. M. Jach, D. Michaels, R. Weismantel, Convex envelopes for (n-1)-convex functions, SIAM Journal on Optimization 19 (3), 2008, 1451 — 1466.
  60. K. Andersen, Q. Louveaux, R. Weismantel, Certificates of linear mixed integer infeasibility, Operations Research Letters 36, 2008, 734 — 738.
  61. A. Wagler, R. Weismantel, The combinatorics of modelling and analyzing biological systems, NACO, 2008, to appear.
  62. K. Andersen, R. Weismantel, Mixed integer linear sets, SIAG/OPT: news and views 19 (2), 2008, 8 — 1.
  63. U.-U. Haus, K. Truemper, R. Weismantel, Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks Journal on Satisfyability, Boolean modelling and Computation 6, 2008, 13 — 32.
  64. U.-U. Haus, K. Niermann, K. Truemper, R. Weismantel, Logic Integer Programming models for signaling networks, Journal of Computational Biology, to appear.

 

Refereed Proceeding Articles

  1. M. Grötschel, A. Martin, R. Weismantel: Routing in grid graphs by cutting planes I, Proc. of the 3rd. IPCO Conference, G. Rinaldi and L. Wolsey (eds.), 1993, 447 — 463.
  2. A. Schulz, R. Weismantel, G. Ziegler: 0/1 Integer programming: optimization and augmentation are equivalent, Lecture Notes in Computer Science 979, Paul Spirakis (ed.), Springer, 1995, 473 — 483.
  3. C. Helmberg, F. Rendl, R. Weismantel: Quadratic knapsack relaxations using cutting planes and semidefinite programming, IPCO conference 1996, Lecture Notes in Computer Science 1084, W. H. Cunningham, S. T. McCormick, M. Queyranne (eds.), Springer, 1996, 175 — 189.
  4. R. Thomas, R. Weismantel, Test sets and inequalities, IPCO conference 1996, Lecture Notes in Computer Science 1084, W. H. Cunningham, S. T. McCormick, M. Queyranne (eds.), Springer, 1996, 16 — 30.
  5. M. Henk, R. Weismantel, Test sets of the knapsack problem and simultaneous diophantine approximation, European Symposium on Algorithms 1997, Lecture Notes in Computer Science 1284, R. Burkard, G. Woeginger (eds.), Springer, 1997, 271 — 283.
  6. G. Cornuejols, R. Urbaniak, R. Weismantel, L. Wolsey, Decomposition of integer programs and of generating sets, European Symposium on Algorithms 1997, Lecture Notes in Computer Science 1284, R. Burkard, G. Woeginger (eds.), Springer, 1997, 92 — 103.
  7. A. Martin, R. Weismantel:, The intersection of knapsack polyhedra and extensions, IPCO conference 1998, Lecture Notes in Computer Science 1412, R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado (eds.), Springer, 1998, 243 — 256.
  8. A. Schulz, R. Weismantel, An oracle-polynomial time augmentation algorithm for integer programming, Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999, 967 — 968.
  9. C. Gentile, U.-U. Haus, M. Köppe, G. Rinaldi, R. Weismantel, A Primal Approach to the Stable Set Problem, European Symposium on Algorithms 2002, Lecture Notes in Computer Science 2641, Springer, 2002, 525 — 537.
  10. B. Spille, R. Weismantel, A generalization of Edmond's matching and matroid intersection algorithms, IPCO conference 2002, Lecture Notes in Computer Science 2337, W.J. Cook and A.S. Schulz (eds.), Springer, 2002, 9 — 20.
  11. J. Gangadwala, A. Kienle, U.-U. Haus, D. Michaels, R. Weismantel, Optimal Process Design for the Synthesis of 2,3-dimethylbutene-1, in Proc. of the European Symposium on Computer-Aided Process Engineering - 15 (20), L. Puigjaner, A. Espuña (eds.), 2005, 847 — 852.
  12. R. Hemmecke, M. Köppe, J. De Loera, R. Weismantel, FPTAS for mixed-integer polynomial optimization with a fixed number of variables, Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, 2006, 743 — 748.
  13. U.-U. Haus, J. Gangadwala, A. Kienle, D. Michaels, A. Seidel-Morgenstern, R. Weismantel, Global bounds on optimal solutions in chemical process design, in Proc. of the European Symposium on Computer-Aided Process Engineering - 16 (21), W. Marquardt, C. Pantelides (eds.), 2006, 155 — 160.
  14. K. Andersen, Q. Louveaux, L. Wolsey, R. Weismantel, Inequalities from two rows of a simplex tableau, IPCO conference 2007, Lecture Notes in Computer Science 4513, Springer, 2007, 1 — 15.
  15. M. Jach, A. Kienle, D. Michaels, R. Weismantel, Novel convex underestimators and their application to the synthesis of combined reaction distillation processes, in Proc. of the European Symposium on Computer-Aided Process Engineering - 18, B. Braunschweig, X. Joulia (eds.), 2008.
  16. M. Durzinsky, A. Wagler, R. Weismantel, A combinatorial approach to reconstruct Petri nets from experimental data, in Proc. of CMSB 2008, M. Heiner and L. Uhrmacher (eds.), Lecture Notes in Computer Science 5307, Springer, 2008, 328 — 346.
  17. L. Torres, A. Wagler, R. Weismantel, Modeling the dynamic behavior of deterministic biological systems, in Proc. of ALIO-EURO 2008, Lecture Notes in Computer Science , Springer, 2008.

 

Articles in Books

  1. K. Aardal, R. Weismantel: Polyhedral Combinatorics, in Annotated Bibiliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli and S. Martello (eds.), Wiley, 1997, 31 — 44.
  2. C. Helmberg, R. Weismantel: Cutting plane algorithms for semidefinite relaxations}, Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications 18, Am. Math. Soc., 1998, 197 — 213.
  3. R. Firla, B. Spille, R. Weismantel: An algorithmic characterization of the bipartite b-matching problem, in Combinatorial Optimization: Eureka you shrink, Papers dedicated to Jack Edmonds, M. Jünger, G. Reinelt and G. Rinaldi (eds.), Lecture Notes in Computer Science 2570, Springer, 2003, 48 — 63.
  4. C. Gentile, U.-U. Haus, M. Köppe, G. Rinaldi, R. Weismantel: A combinatorial algorithm for stable sets in graphs, in "The Sharpest Cut", Festschrift in honor of Manfred Padberg, M. Grötschel (ed.), 51 - 74, SIAM Lecture series, 2004.
  5. B. Spille, R. Weismantel: Primal Integer Programming, in Handbooks in OR and MS, Vol. 12, Discrete Optimization, K. Aardal, G. Nemhauser and R. Weismantel (eds.), Elsevier, 245 —274, 2005.

 

Books and Theses

  1. R. Weismantel: Mixed Integer Nonlinear Programming, The CORE Lecture Series, Louvain la Neuve, Belgium, 123 pages, 2006.
  2. D. Bertsimas, R. Weismantel: Optimization over Integers, Dynamic Ideas, Belmont, MA, 2005.
  3. K. Aardal, G. Nemhauser, R. Weismantel (eds.): Handbooks in OR and MS, Vol. 12, Discrete Optimization, Elsevier Publishers 2005.
  4. R. Weismantel: Plazieren von Zellen: Theorie und Lösung eines quadratischen 0/1-Optimierungsproblems, Dissertation, Technische Universität Berlin, März 1992.
  5. R. Weismantel: Knapsack Problems, Test sets and Polyhedra, Habilitation, Technische Universität Berlin, Juni 1995.
    home        last modified: 2009-01-07