Horst W. Hamacher

Publication Activity (10 Years)

Years Active: 1979-2020
Publications (10 Years): 7

Top Topics

Greedy Algorithm

Location Problems

Single Facility

Top Venues

Discret. Appl. Math.

EURO J. Comput. Optim.

Discret. Optim.

Ann. Oper. Res.

Publications

Nicolas Fröhlich, Andrea Maier, Horst W. Hamacher
Covering edges in networks. Networks 75 (3) (2020)
Andrea Maier, Horst W. Hamacher
Complexity results on planar multifacility location problems with forbidden regions. Math. Methods Oper. Res. 89 (3) (2019)
Andrea Maier, Thomas Ullmert, Horst W. Hamacher
Planar multifacility location problems with tree structure and finite dominating sets. Discret. Optim. 33 (2019)
Marc Goerigk, Horst W. Hamacher, Anika Kinscherff
Ranking robustness and its application to evacuation planning. Eur. J. Oper. Res. 264 (3) (2018)
Davaatseren Baatar, Matthias Ehrgott, Horst W. Hamacher, Ines M. Raschendorfer
Minimizing the number of apertures in multileaf collimator sequencing with field splitting. Discret. Appl. Math. 250 (2018)
Philipp Heßler, Horst W. Hamacher
Sink location to find optimal shelters in evacuation planning. EURO J. Comput. Optim. 4 (3-4) (2016)
Marc Goerigk, Horst W. Hamacher
SI: disaster risk management. EURO J. Comput. Optim. 4 (3-4) (2016)
Lara Turner, Matthias Ehrgott, Horst W. Hamacher
On the generality of the greedy algorithm for solving matroid base problems. Discret. Appl. Math. 195 (2015)
Lara Turner, Matthias Ehrgott, Horst W. Hamacher
On the generality of the greedy algorithm for solving matroid problems. CTW (2013)
Horst W. Hamacher, Stephanie Heller, Benjamin Rupp
Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. Ann. Oper. Res. 207 (1) (2013)
Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher
On generalized balanced optimization problems. Math. Methods Oper. Res. 73 (1) (2011)
Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt
Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14 (5) (2011)
Stephanie Heller, Horst W. Hamacher
The Multi Terminal q-FlowLoc Problem: A Heuristic. INOC (2011)
Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn
A separation algorithm for improved LP-decoding of linear block codes. IEEE Trans. Inf. Theory 56 (7) (2010)
Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn
Minimum cut bases in undirected networks. Discret. Appl. Math. 158 (4) (2010)
Çigdem Güler, Horst W. Hamacher
Capacity inverse minimum cost flow problem. J. Comb. Optim. 19 (1) (2010)
Matthias Ehrgott, Çigdem Güler, Horst W. Hamacher, Lizhen Shao
Mathematical optimization in intensity modulated radiation therapy. Ann. Oper. Res. 175 (1) (2010)
Lara Turner, Horst W. Hamacher
On Universal Shortest Paths. OR (2010)
Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. J. Sched. 12 (4) (2009)
Anita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner
The Continuous Stop Location Problem in Public Transportation Networks. Asia Pac. J. Oper. Res. 26 (1) (2009)
Davaatseren Baatar, Natashia Boland, Robert Johnston, Horst W. Hamacher
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. INFORMS J. Comput. 21 (2) (2009)
Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar
Valid inequalities for binary linear codes. ISIT (2009)
Olga Gluchshenko, Horst W. Hamacher, Arie Tamir
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. 37 (3) (2009)
Stefan Ruzika, Horst W. Hamacher
A Survey on Multiple Objective Minimum Spanning Tree Problems. Algorithmics of Large and Complex Networks (2009)
Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger
Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36 (7) (2009)
Horst W. Hamacher, T. Meyer
New developments on hub location. Comput. Oper. Res. 36 (12) (2009)
Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes CoRR (2008)
Matthias Ehrgott, Çigdem Güler, Horst W. Hamacher, Lizhen Shao
Mathematical optimization in intensity modulated radiation therapy. 4OR 6 (3) (2008)
S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick Ndiaye, Stefan Nickel, Blas Pelegrín
New trends in locational analysis. Comput. Oper. Res. 35 (3) (2008)
Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika
Finding representative systems for discrete bicriterion optimization problems. Oper. Res. Lett. 35 (3) (2007)
Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika
Multiple objective minimum cost flow problems: A review. Eur. J. Oper. Res. 176 (3) (2007)
Horst W. Hamacher
Consecutive Ones Decomposition of Integer Matrices and Applications. Electron. Notes Discret. Math. 27 (2006)
Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra
Algorithms for time-dependent bicriteria shortest path problems. Discret. Optim. 3 (3) (2006)
Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154 (9) (2006)
Horst W. Hamacher, Matthias Ehrgott
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. Discret. Appl. Math. 152 (1-3) (2005)
Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger
Decomposition of integer matrices and multileaf collimator sequencing. Discret. Appl. Math. 152 (1-3) (2005)
Ravindra K. Ahuja, Horst W. Hamacher
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45 (1) (2005)
Horst W. Hamacher
Decomposition of Consecutive-1 Matrices and Applications. CTW (2004)
Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
Adapting polyhedral properties from facility to hub location problems. Discret. Appl. Math. 145 (1) (2004)
Horst W. Hamacher
Decomposition of consecutive-1 matrices and applications. Electron. Notes Discret. Math. 17 (2004)
Horst W. Hamacher, Anita Schöbel
Design of Zone Tariff Systems in Public Transportation. Oper. Res. 52 (6) (2004)
Natashia Boland, Horst W. Hamacher, Frank Lenzen
Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43 (4) (2004)
Les R. Foulds, Horst W. Hamacher, Anita Schöbel, Tadashi Yamaguchi
On Center Cycles in Grid Graphs. Ann. Oper. Res. 122 (1-4) (2003)
Steffen Fleßa, Horst W. Hamacher, Karl-Heinz Küfer
Editorial. OR Spectr. 25 (2) (2003)
Horst W. Hamacher, Karl-Heinz Küfer
Inverse radiation therapy planning - a multiple objective optimization approach. Discret. Appl. Math. 118 (1-2) (2002)
Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. Ann. Oper. Res. 110 (1-4) (2002)
Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner
Locating New Stops in a Railway Network. Electron. Notes Theor. Comput. Sci. 50 (1) (2001)
Emilio Carrizosa, Horst W. Hamacher, Rolf Klein, Stefan Nickel
Solving Nonconvex Planar Location Problems by Finite Dominating Sets. J. Glob. Optim. 18 (2) (2000)
Horst W. Hamacher, Kathrin Klamroth
Planar Weber location problems with barriers and block norms. Ann. Oper. Res. 96 (1-4) (2000)
Matthias Ehrgott, Horst W. Hamacher, Stefan Nickel
Geometric Methods to Solve Max-Ordering Location Problems. Discret. Appl. Math. 93 (1) (1999)
Horst W. Hamacher, Martine Labbé, Stefan Nickel
Multicriteria network location problems with sum objectives. Networks 33 (2) (1999)
Petra Huh, Horst W. Hamacher
Book reviews. Math. Methods Oper. Res. 47 (1) (1998)
Les R. Foulds, Horst W. Hamacher, John M. Wilson
Integer programming approaches tofacilities layout models with forbidden areas. Ann. Oper. Res. 81 (1998)
Horst W. Hamacher, Anita Schöbel
A note on center problems with forbidden polyhedra. Oper. Res. Lett. 20 (4) (1997)
Horst W. Hamacher
best network flows. Ann. Oper. Res. 57 (1) (1995)
Horst W. Hamacher, Günther Ruhe
On spanning tree problems with multiple objectives. Ann. Oper. Res. 52 (4) (1994)
Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli
-cardinality trees: Complexity and polyhedral structure. Networks 24 (1) (1994)
Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty
Note on Combinatorial Optimization with Max-Linear Objective Functions. Discret. Appl. Math. 42 (2) (1993)
Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci
Preface. Discret. Appl. Math. 47 (2) (1993)
Horst W. Hamacher, Eberhard Triesch
Book reviews. ZOR Methods Model. Oper. Res. 38 (2) (1993)
Horst W. Hamacher, Franz Rendl
Color constrained combinatorial optimization problems. Oper. Res. Lett. 10 (4) (1991)
Horst W. Hamacher
Book review. ZOR Methods Model. Oper. Res. 35 (4) (1991)
Horst W. Hamacher
Theoretical and Computational Aspects of Simulated Annealing (P. J. M. van Laarhoven E. H. L. Aarts) and Simulated Annealing: Theory and Applications (P. J. M. van Laarhoven and E. H. L. Aarts). SIAM Rev. 32 (3) (1990)
Horst W. Hamacher, Les R. Foulds
Algorithms for flows with parametric capacities. ZOR Methods Model. Oper. Res. 33 (1) (1989)
Paolo M. Camerini, Horst W. Hamacher
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking. SIAM J. Discret. Math. 2 (1) (1989)
Chandra R. Chegireddy, Horst W. Hamacher
Algorithms for finding K-best perfect matchings. Discret. Appl. Math. 18 (2) (1987)
Horst W. Hamacher
Maximal dynamic polymatroid flows and applications. Discret. Appl. Math. 15 (1) (1986)
Horst W. Hamacher
A time expanded matroid algorithm for finding optimal dynamic matroid intersections. Z. Oper. Research 29 (5) (1985)
Horst W. Hamacher
K Best Cuts in Planar and Nonplanar Networks. WG (1982)
Horst W. Hamacher
Determining minimal cuts with a minimal number of arcs. Networks 12 (4) (1982)
Rainer E. Burkard, Horst W. Hamacher, Jørgen Tind
On abstract duality in mathematical programming. Z. Oper. Research 26 (1) (1982)
Horst W. Hamacher
) algorithm for finding the k best cuts in a network. Oper. Res. Lett. 1 (5) (1982)
Horst W. Hamacher
Decomposition of group flows in regular matroids. Computing 29 (2) (1982)
Helmut Friesdorf, Horst W. Hamacher
A Negative Circuit Algorithm for Weighted Min Cost Flows. WG (1981)
Helmut Friesdorf, Horst W. Hamacher
A note on weighted minimal cost flows. Z. Oper. Research 25 (1) (1981)
Horst W. Hamacher
Optimal (s, t)-Cuts (Extended Abstract). WG (1980)
Horst W. Hamacher
Algebraic flows in regular matroids. Discret. Appl. Math. 2 (1) (1980)
Horst W. Hamacher
Numerical investigations on the maximal flow algorithm of Karzanov. Computing 22 (1) (1979)