The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Robert Weismantel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert T. Firla, Bianca Spille, Robert Weismantel
    Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:48-63 [Conf]
  2. Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
    Decomposition of Integer Programs and of Generating Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:92-102 [Conf]
  3. Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel
    A Primal Approach to the Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:525-537 [Conf]
  4. Martin Henk, Robert Weismantel
    Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:271-283 [Conf]
  5. Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler
    0/1-Integer Programming: Optimization and Augmentation are Equivalent. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:473-483 [Conf]
  6. Martin Grötschel, Alexander Martin, Robert Weismantel
    Routing in grid graphs by cutting planes. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:447-461 [Conf]
  7. Christoph Helmberg, Franz Rendl, Robert Weismantel
    Quadratic Knapsack Relaxations Using Cutting Planes. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:175-189 [Conf]
  8. Alexander Martin, Robert Weismantel
    The Intersection of Knapsack Polyhedra and Extensions. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:243-256 [Conf]
  9. Bianca Spille, Robert Weismantel
    A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:9-20 [Conf]
  10. Rekha R. Thomas, Robert Weismantel
    Test Sets and Inequalities for Integer Programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:16-30 [Conf]
  11. Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel
    FPTAS for mixed-integer polynomial optimization with a fixed number of variables. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:743-748 [Conf]
  12. Andreas S. Schulz, Robert Weismantel
    An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:967-968 [Conf]
  13. Matthias Jach, Matthias Köppe, Robert Weismantel
    Nondecomposable solutions to group equations and an application to polyhedral combinatorics. [Citation Graph (0, 0)][DBLP]
    4OR, 2006, v:4, n:1, pp:29-46 [Journal]
  14. Rekha R. Thomas, Robert Weismantel
    Truncated Gröbner Bases for Integer Programming. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:4, pp:241-256 [Journal]
  15. Martin Henk, Robert Weismantel
    Diophantine Approximations and Integer Points of Cones. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:401-408 [Journal]
  16. Karen Aardal, Robert Weismantel, Laurence A. Wolsey
    Non-standard approaches to integer programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:5-74 [Journal]
  17. Ralf Borndörfer, Robert Weismantel
    Discrete relaxations of combinatorial programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:11-26 [Journal]
  18. Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey
    Cutting planes in integer and mixed integer programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:397-446 [Journal]
  19. Martin Grötschel, Alexander Martin, Robert Weismantel
    Packing Steiner Trees: Further Facets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:1, pp:39-52 [Journal]
  20. Christoph Helmberg, Franz Rendl, Robert Weismantel
    A Semidefinite Programming Approach to the Quadratic Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:197-215 [Journal]
  21. Andreas S. Schulz, Robert Weismantel
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:4, pp:681-692 [Journal]
  22. C. E. Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
    Formulations and valid inequalities for the node capacitated graph partitioning problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:247-266 [Journal]
  23. C. E. Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
    The node capacitated graph partitioning problem: A computational study. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:229-256 [Journal]
  24. Martin Grötschel, Alexander Martin, Robert Weismantel
    Packing Steiner trees: polyhedral investigations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:72, n:, pp:101-123 [Journal]
  25. Martin Grötschel, Alexander Martin, Robert Weismantel
    Packing Steiner trees: a cutting plane algorithm and computational results. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:72, n:, pp:125-145 [Journal]
  26. Martin Grötschel, Alexander Martin, Robert Weismantel
    The Steiner tree packing problem in VLSI design. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:265-281 [Journal]
  27. Utz-Uwe Haus, Matthias Köppe, Robert Weismantel
    A primal all-integer algorithm based on irreducible solutions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:96, n:2, pp:205-246 [Journal]
  28. Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
    Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:63, n:, pp:257-279 [Journal]
  29. Dennis Michaels, Robert Weismantel
    Polyhedra related to integer-convex polynomial systems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:215-232 [Journal]
  30. Robert Weismantel
    On the 0/1 knapsack polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:49-68 [Journal]
  31. Matthias Köppe, Robert Weismantel
    Cutting planes from a mixed integer Farkas lemma. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:207-211 [Journal]
  32. Kazuo Murota, Hiroo Saito, Robert Weismantel
    Optimality criterion for a class of nonlinear integer programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:468-472 [Journal]
  33. Martin Grötschel, Alexander Martin, Robert Weismantel
    Packing Steiner Trees: Separation Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:233-257 [Journal]
  34. Regina Urbaniak, Robert Weismantel, Günter M. Ziegler
    A Variant of the Buchberger Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:96-108 [Journal]
  35. Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
    Inequalities from Two Rows of a Simplex Tableau. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:1-15 [Conf]

  36. Nonlinear Optimization over a Weighted Independence System. [Citation Graph (, )][DBLP]


  37. A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. [Citation Graph (, )][DBLP]


  38. A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. [Citation Graph (, )][DBLP]


  39. Zero-Coefficient Cuts. [Citation Graph (, )][DBLP]


  40. A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems. [Citation Graph (, )][DBLP]


  41. Nonlinear Optimization over a Weighted Independence System [Citation Graph (, )][DBLP]


  42. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.050secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002