The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Martin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Martin
    General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. [Citation Graph (0, 0)][DBLP]
    Computational Combinatorial Optimization, 2001, pp:1-25 [Conf]
  2. Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
    Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2006, pp:1-12 [Conf]
  3. 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]
  4. Alexander Martin, Robert Weismantel
    The Intersection of Knapsack Polyhedra and Extensions. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:243-256 [Conf]
  5. 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]
  6. 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]
  7. Robert E. Bixby, Alexander Martin
    Parallelizing the Dual Simplex Method. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:45-56 [Journal]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. Alexander Martin, Markus Möller, Susanne Moritz
    Mixed Integer Models for the Stationary Case of Gas Network Optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:563-582 [Journal]
  15. Thorsten Koch, Alexander Martin
    Solving Steiner tree problems in graphs to optimality. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:3, pp:207-232 [Journal]
  16. Tobias Achterberg, Thorsten Koch, Alexander Martin
    Branching rules revisited. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:1, pp:42-54 [Journal]
  17. Tobias Achterberg, Thorsten Koch, Alexander Martin
    MIPLIB 2003. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:361-372 [Journal]
  18. 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]

  19. Polyhedral and Algorithmic Properties of Quantified Linear Programs. [Citation Graph (, )][DBLP]


  20. A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. [Citation Graph (, )][DBLP]


  21. Locomotive and Wagon Scheduling in Freight Transport. [Citation Graph (, )][DBLP]


  22. LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. [Citation Graph (, )][DBLP]


  23. Optimization of Sheet Metal Products. [Citation Graph (, )][DBLP]


  24. Integrated Optimization of School Starting Times and Public Bus Services. [Citation Graph (, )][DBLP]


  25. BisoGenet: a new tool for gene network building, visualization and analysis. [Citation Graph (, )][DBLP]


  26. Efficient reformulation and solution of a nonlinear PDE-controlled flow network model. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002