Numerical investigations on the maximal flow algorithm of Karzanov. - Horst W. Hamacher (Computing, 1979)

Optimal (s, t)-Cuts (Extended Abstract). - Horst W. Hamacher (WG, 1980)

Algebraic flows in regular matroids. - Horst W. Hamacher (Discret. Appl. Math., 1980)

A Negative Circuit Algorithm for Weighted Min Cost Flows. - Helmut Friesdorf; Horst W. Hamacher (WG, 1981)

A note on weighted minimal cost flows. - Helmut Friesdorf; Horst W. Hamacher (Z. Oper. Research, 1981)

K Best Cuts in Planar and Nonplanar Networks. - Horst W. Hamacher (WG, 1982)

Decomposition of group flows in regular matroids. - Horst W. Hamacher (Computing, 1982)

On abstract duality in mathematical programming. - Rainer E. Burkard; Horst W. Hamacher; Jørgen Tind (Z. Oper. Research, 1982)

Determining minimal cuts with a minimal number of arcs. - Horst W. Hamacher (Networks, 1982)

An O(K·n4) algorithm for finding the k best cuts in a network. - Horst W. Hamacher (Oper. Res. Lett., 1982)

A time expanded matroid algorithm for finding optimal dynamic matroid intersections. - Horst W. Hamacher (Z. Oper. Research, 1985)

Maximal dynamic polymatroid flows and applications. - Horst W. Hamacher (Discret. Appl. Math., 1986)

Algorithms for finding K-best perfect matchings. - Chandra R. Chegireddy; Horst W. Hamacher (Discret. Appl. Math., 1987)

Algorithms for flows with parametric capacities. - Horst W. Hamacher; Les R. Foulds (ZOR Methods Model. Oper. Res., 1989)

Intersection of Two Matroids: (Condensed) Border Graphs and Ranking. - Paolo M. Camerini; Horst W. Hamacher (SIAM J. Discret. Math., 1989)

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). - Horst W. Hamacher (SIAM Rev., 1990)

Book review. - Horst W. Hamacher (ZOR Methods Model. Oper. Res., 1991)

Color constrained combinatorial optimization problems. - Horst W. Hamacher; Franz Rendl (Oper. Res. Lett., 1991)

Preface. - Mustafa Akgül; Horst W. Hamacher; Süleyman Tüfekci (Discret. Appl. Math., 1993)

Note on Combinatorial Optimization with Max-Linear Objective Functions. - Sung-Jin Chung; Horst W. Hamacher; Francesco Maffioli; Katta G. Murty (Discret. Appl. Math., 1993)

Book reviews. - Horst W. Hamacher; Eberhard Triesch (ZOR Methods Model. Oper. Res., 1993)

On spanning tree problems with multiple objectives. - Horst W. Hamacher; Günther Ruhe (Ann. Oper. Res., 1994)

Weighted k-cardinality trees: Complexity and polyhedral structure. - Matteo Fischetti; Horst W. Hamacher; Kurt Jørnsten; Francesco Maffioli (Networks, 1994)

Mathematische Lösungsverfahren für planare Standortprobleme. - Horst W. Hamacher (Vieweg, 1995)

A note onK best network flows. - Horst W. Hamacher (Ann. Oper. Res., 1995)

A note on center problems with forbidden polyhedra. - Horst W. Hamacher; Anita Schöbel (Oper. Res. Lett., 1997)

Integer programming approaches tofacilities layout models with forbidden areas. - Les R. Foulds; Horst W. Hamacher; John M. Wilson 001 (Ann. Oper. Res., 1998)

Book reviews. - Petra Huh; Horst W. Hamacher (Math. Methods Oper. Res., 1998)

Geometric Methods to Solve Max-Ordering Location Problems. - Matthias Ehrgott; Horst W. Hamacher; Stefan Nickel (Discret. Appl. Math., 1999)

Multicriteria network location problems with sum objectives. - Horst W. Hamacher; Martine Labbé; Stefan Nickel (Networks, 1999)

Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook. - Horst W. Hamacher; Kathrin Klamroth (Vieweg, 2000)

Planar Weber location problems with barriers and block norms. - Horst W. Hamacher; Kathrin Klamroth (Ann. Oper. Res., 2000)

Solving Nonconvex Planar Location Problems by Finite Dominating Sets. - Emilio Carrizosa; Horst W. Hamacher; Rolf Klein; Stefan Nickel (J. Glob. Optim., 2000)

Locating New Stops in a Railway Network. - Horst W. Hamacher; Annegret Liebers; Anita Schöbel; Dorothea Wagner; Frank Wagner 001 (ATMOS, 2001)

Facility location - applications and theory. - Zvi Drezner; Horst W. Hamacher (Springer, 2002)

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. - Horst W. Hamacher; Martine Labbé; Stefan Nickel; Anders J. V. Skriver (Ann. Oper. Res., 2002)

Inverse radiation therapy planning - a multiple objective optimization approach. - Horst W. Hamacher; Karl-Heinz Küfer (Discret. Appl. Math., 2002)

On Center Cycles in Grid Graphs. - Les R. Foulds; Horst W. Hamacher; Anita Schöbel; Tadashi Yamaguchi (Ann. Oper. Res., 2003)

Editorial. - Steffen Fleßa; Horst W. Hamacher; Karl-Heinz Küfer (OR Spectr., 2003)

Adapting polyhedral properties from facility to hub location problems. - Horst W. Hamacher; Martine Labbé; Stefan Nickel; Tim Sonneborn (Discret. Appl. Math., 2004)

Decomposition of consecutive-1 matrices and applications. - Horst W. Hamacher (Electron. Notes Discret. Math., 2004)

Design of Zone Tariff Systems in Public Transportation. - Horst W. Hamacher; Anita Schöbel (Oper. Res., 2004)

Minimizing beam-on time in cancer radiation treatment using multileaf collimators. - Natashia Boland; Horst W. Hamacher; Frank Lenzen (Networks, 2004)

Decomposition of integer matrices and multileaf collimator sequencing. - Davaatseren Baatar; Horst W. Hamacher; Matthias Ehrgott; Gerhard J. Woeginger (Discret. Appl. Math., 2005)

Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. - Horst W. Hamacher; Matthias Ehrgott (Discret. Appl. Math., 2005)

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. - Ravindra K. Ahuja; Horst W. Hamacher (Networks, 2005)

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. - Maurizio Bruglieri; Matthias Ehrgott; Horst W. Hamacher; Francesco Maffioli (Discret. Appl. Math., 2006)

Algorithms for time-dependent bicriteria shortest path problems. - Horst W. Hamacher; Stefan Ruzika; Stevanus A. Tjandra (Discret. Optim., 2006)

Consecutive Ones Decomposition of Integer Matrices and Applications. - Horst W. Hamacher (Electron. Notes Discret. Math., 2006)

Multiple objective minimum cost flow problems: A review. - Horst W. Hamacher; Christian Roed Pedersen; Stefan Ruzika (Eur. J. Oper. Res., 2007)

Finding representative systems for discrete bicriterion optimization problems. - Horst W. Hamacher; Christian Roed Pedersen; Stefan Ruzika (Oper. Res. Lett., 2007)

Mathematical optimization in intensity modulated radiation therapy. - Matthias Ehrgott; Çigdem Güler; Horst W. Hamacher; Lizhen Shao (4OR, 2008)

New trends in locational analysis. - 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; et al. (Comput. Oper. Res., 2008)

A Survey on Multiple Objective Minimum Spanning Tree Problems. - Stefan Ruzika; Horst W. Hamacher (Algorithmics of Large and Complex Networks, 2009)

Valid inequalities for binary linear codes. - Stefan Ruzika; Akin Tanatmis; Frank Kienle; Horst W. Hamacher; Norbert Wehn; Mayur Punekar (ISIT, 2009)

The Continuous Stop Location Problem in Public Transportation Networks. - Anita Schöbel; Horst W. Hamacher; Annegret Liebers; Dorothea Wagner (Asia Pac. J. Oper. Res., 2009)

Uncapacitated single and multiple allocation p-hub center problems. - Andreas T. Ernst; Horst W. Hamacher; Houyuan Jiang; Mohan Krishnamoorthy; Gerhard J. Woeginger (Comput. Oper. Res., 2009)

New developments on hub location. - Horst W. Hamacher; T. Meyer (Comput. Oper. Res., 2009)

A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. - Davaatseren Baatar; Natashia Boland; Robert Johnston; Horst W. Hamacher (INFORMS J. Comput., 2009)

An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. - Olga Gluchshenko; Horst W. Hamacher; Arie Tamir (Oper. Res. Lett., 2009)

Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. - Donatas Elvikis; Horst W. Hamacher; Marcel T. Kalsch (J. Sched., 2009)

Facilities Layout Problems. - Les R. Foulds; Horst W. Hamacher (Encyclopedia of Optimization, 2009)

Multifacility and Restricted Location Problems. - Horst W. Hamacher; Stefan Nickel (Encyclopedia of Optimization, 2009)

On Universal Shortest Paths. - Lara Turner; Horst W. Hamacher (OR, 2010)

Minimum cut bases in undirected networks. - Florentine Bunke; Horst W. Hamacher; Francesco Maffioli; Anne M. Schwahn (Discret. Appl. Math., 2010)

Capacity inverse minimum cost flow problem. - Çigdem Güler; Horst W. Hamacher (J. Comb. Optim., 2010)

A separation algorithm for improved LP-decoding of linear block codes. - Akin Tanatmis; Stefan Ruzika; Horst W. Hamacher; Mayur Punekar; Frank Kienle; Norbert Wehn (IEEE Trans. Inf. Theory, 2010)

The Multi Terminal q-FlowLoc Problem: A Heuristic. - Stephanie Heller; Horst W. Hamacher (INOC, 2011)

On generalized balanced optimization problems. - Lara Turner; Abraham P. Punnen; Yash P. Aneja; Horst W. Hamacher (Math. Methods Oper. Res., 2011)

Scheduling two agents on uniform parallel machines with makespan and cost functions. - Donatas Elvikis; Horst W. Hamacher; Vincent T'kindt (J. Sched., 2011)

On the generality of the greedy algorithm for solving matroid problems. - Lara Turner; Matthias Ehrgott; Horst W. Hamacher (CTW, 2013)

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. - Horst W. Hamacher; Stephanie Heller; Benjamin Rupp (Ann. Oper. Res., 2013)

On the generality of the greedy algorithm for solving matroid base problems. - Lara Turner; Matthias Ehrgott; Horst W. Hamacher (Discret. Appl. Math., 2015)

SI: disaster risk management. - Marc Goerigk; Horst W. Hamacher (EURO J. Comput. Optim., 2016)

Sink location to find optimal shelters in evacuation planning. - Philipp Heßler; Horst W. Hamacher (EURO J. Comput. Optim., 2016)

Minimizing the number of apertures in multileaf collimator sequencing with field splitting. - Davaatseren Baatar; Matthias Ehrgott; Horst W. Hamacher; Ines M. Raschendorfer (Discret. Appl. Math., 2018)

Ranking robustness and its application to evacuation planning. - Marc Goerigk; Horst W. Hamacher; Anika Kinscherff (Eur. J. Oper. Res., 2018)

Planar multifacility location problems with tree structure and finite dominating sets. - Andrea Maier; Thomas Ullmert; Horst W. Hamacher (Discret. Optim., 2019)

Complexity results on planar multifacility location problems with forbidden regions. - Andrea Maier; Horst W. Hamacher (Math. Methods Oper. Res., 2019)

Covering edges in networks. - Nicolas Fröhlich 002; Andrea Maier; Horst W. Hamacher (Networks, 2020)