The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Horst W. Hamacher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Horst W. Hamacher
    Optimal (s, t)-Cuts (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:383-387 [Conf]
  2. Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:85- [Journal]
  3. Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger
    Decomposition of integer matrices and multileaf collimator sequencing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:6-34 [Journal]
  4. Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty
    Note on Combinatorial Optimization with Max-Linear Objective Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:139-145 [Journal]
  5. Matthias Ehrgott, Horst W. Hamacher, Stefan Nickel
    Geometric Methods to Solve Max-Ordering Location Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:3-20 [Journal]
  6. Horst W. Hamacher, Matthias Ehrgott
    Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:4-5 [Journal]
  7. Horst W. Hamacher, Karl-Heinz Küfer
    Inverse radiation therapy planning - a multiple objective optimization approach. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:145-161 [Journal]
  8. Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
    Adapting polyhedral properties from facility to hub location problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:104-116 [Journal]
  9. Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli
    An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1344-1357 [Journal]
  10. Horst W. Hamacher, Annegret Liebers, Anita Schoebel, Dorothea Wagner, Frank Wagner
    Locating New Stops in a Railway Network. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
  11. Ravindra K. Ahuja, Horst W. Hamacher
    A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:36-41 [Journal]
  12. Natashia Boland, Horst W. Hamacher, Frank Lenzen
    Minimizing beam-on time in cancer radiation treatment using multileaf collimators. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:4, pp:226-240 [Journal]
  13. Horst W. Hamacher, Martine Labbé, Stefan Nickel
    Multicriteria network location problems with sum objectives. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:2, pp:79-92 [Journal]
  14. Paolo M. Camerini, Horst W. Hamacher
    Intersection of Two Matroids: (Condensed) Border Graphs and Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:16-27 [Journal]
  15. Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika
    Multiple objective minimum cost flow problems: A review. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:3, pp:1404-1422 [Journal]

  16. A Survey on Multiple Objective Minimum Spanning Tree Problems. [Citation Graph (, )][DBLP]


  17. Mathematical optimization in intensity modulated radiation therapy. [Citation Graph (, )][DBLP]


  18. New trends in locational analysis. [Citation Graph (, )][DBLP]


  19. Uncapacitated single and multiple allocation p-hub center problems. [Citation Graph (, )][DBLP]


  20. New developments on hub location. [Citation Graph (, )][DBLP]


  21. A Separation Algorithm for Improved LP-Decoding of Linear Block Codes [Citation Graph (, )][DBLP]


  22. Minimum cut bases in undirected networks. [Citation Graph (, )][DBLP]


Search in 0.004secs, 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