default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHorst W. Hamacher
Person information
- affiliation: University of Kaiserslautern
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j67]Nicolas Fröhlich
, Andrea Maier, Horst W. Hamacher:
Covering edges in networks. Networks 75(3): 278-290 (2020)
2010 – 2019
- 2019
- [j66]Andrea Maier, Thomas Ullmert, Horst W. Hamacher:
Planar multifacility location problems with tree structure and finite dominating sets. Discret. Optim. 33: 19-42 (2019) - [j65]Andrea Maier, Horst W. Hamacher:
Complexity results on planar multifacility location problems with forbidden regions. Math. Methods Oper. Res. 89(3): 433-484 (2019) - 2018
- [j64]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: 87-103 (2018) - [j63]Marc Goerigk, Horst W. Hamacher, Anika Kinscherff:
Ranking robustness and its application to evacuation planning. Eur. J. Oper. Res. 264(3): 837-846 (2018) - 2016
- [j62]Marc Goerigk, Horst W. Hamacher:
SI: disaster risk management. EURO J. Comput. Optim. 4(3-4): 215-217 (2016) - [j61]Philipp Heßler, Horst W. Hamacher:
Sink location to find optimal shelters in evacuation planning. EURO J. Comput. Optim. 4(3-4): 325-347 (2016) - 2015
- [j60]Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid base problems. Discret. Appl. Math. 195: 114-128 (2015) - 2013
- [j59]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): 161-180 (2013) - [i2]Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid problems. CTW 2013: 217-220 - 2011
- [j58]Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher:
On generalized balanced optimization problems. Math. Methods Oper. Res. 73(1): 19-27 (2011) - [j57]Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt:
Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14(5): 471-481 (2011) - [c9]Stephanie Heller, Horst W. Hamacher:
The Multi Terminal q-FlowLoc Problem: A Heuristic. INOC 2011: 523-528 - 2010
- [j56]Matthias Ehrgott, Çigdem Güler, Horst W. Hamacher, Lizhen Shao:
Mathematical optimization in intensity modulated radiation therapy. Ann. Oper. Res. 175(1): 309-365 (2010) - [j55]Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn:
Minimum cut bases in undirected networks. Discret. Appl. Math. 158(4): 277-290 (2010) - [j54]Çigdem Güler, Horst W. Hamacher:
Capacity inverse minimum cost flow problem. J. Comb. Optim. 19(1): 43-59 (2010) - [j53]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): 3277-3289 (2010) - [c8]Lara Turner, Horst W. Hamacher:
On Universal Shortest Paths. OR 2010: 313-318
2000 – 2009
- 2009
- [j52]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): 13-30 (2009) - [j51]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): 2230-2241 (2009) - [j50]Horst W. Hamacher, T. Meyer:
New developments on hub location. Comput. Oper. Res. 36(12): 3087 (2009) - [j49]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): 224-241 (2009) - [j48]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): 168-170 (2009) - [j47]Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch:
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. J. Sched. 12(4): 361-374 (2009) - [c7]Stefan Ruzika, Horst W. Hamacher:
A Survey on Multiple Objective Minimum Spanning Tree Problems. Algorithmics of Large and Complex Networks 2009: 104-116 - [c6]Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar:
Valid inequalities for binary linear codes. ISIT 2009: 2216-2220 - [r2]Les R. Foulds, Horst W. Hamacher:
Facilities Layout Problems. Encyclopedia of Optimization 2009: 975-979 - [r1]Horst W. Hamacher, Stefan Nickel:
Multifacility and Restricted Location Problems. Encyclopedia of Optimization 2009: 2409-2413 - 2008
- [j46]Matthias Ehrgott, Çigdem Güler, Horst W. Hamacher, Lizhen Shao:
Mathematical optimization in intensity modulated radiation therapy. 4OR 6(3): 199-262 (2008) - [j45]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 M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [i1]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 abs/0812.2559 (2008) - 2007
- [j44]Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika:
Multiple objective minimum cost flow problems: A review. Eur. J. Oper. Res. 176(3): 1404-1422 (2007) - [j43]Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika:
Finding representative systems for discrete bicriterion optimization problems. Oper. Res. Lett. 35(3): 336-344 (2007) - 2006
- [j42]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): 1344-1357 (2006) - [j41]Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra:
Algorithms for time-dependent bicriteria shortest path problems. Discret. Optim. 3(3): 238-254 (2006) - [j40]Horst W. Hamacher:
Consecutive Ones Decomposition of Integer Matrices and Applications. Electron. Notes Discret. Math. 27: 47-48 (2006) - 2005
- [j39]Horst W. Hamacher, Matthias Ehrgott:
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. Discret. Appl. Math. 152(1-3): 4-5 (2005) - [j38]Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger:
Decomposition of integer matrices and multileaf collimator sequencing. Discret. Appl. Math. 152(1-3): 6-34 (2005) - [j37]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): 36-41 (2005) - 2004
- [j36]Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn:
Adapting polyhedral properties from facility to hub location problems. Discret. Appl. Math. 145(1): 104-116 (2004) - [j35]Horst W. Hamacher:
Decomposition of consecutive-1 matrices and applications. Electron. Notes Discret. Math. 17: 3 (2004) - [j34]Horst W. Hamacher, Anita Schöbel:
Design of Zone Tariff Systems in Public Transportation. Oper. Res. 52(6): 897-908 (2004) - [j33]Natashia Boland, Horst W. Hamacher, Frank Lenzen:
Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43(4): 226-240 (2004) - [c5]Horst W. Hamacher:
Decomposition of Consecutive-1 Matrices and Applications. CTW 2004: 12 - 2003
- [j32]Les R. Foulds, Horst W. Hamacher, Anita Schöbel, Tadashi Yamaguchi:
On Center Cycles in Grid Graphs. Ann. Oper. Res. 122(1-4): 163-175 (2003) - [j31]Steffen Fleßa, Horst W. Hamacher, Karl-Heinz Küfer:
Editorial. OR Spectr. 25(2): 143-144 (2003) - 2002
- [b3]Zvi Drezner, Horst W. Hamacher:
Facility location - applications and theory. Springer 2002, ISBN 978-3-540-42172-6, pp. I-XVI, 1-457 - [j30]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): 33-53 (2002) - [j29]Horst W. Hamacher, Karl-Heinz Küfer:
Inverse radiation therapy planning - a multiple objective optimization approach. Discret. Appl. Math. 118(1-2): 145-161 (2002) - 2001
- [c4]Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner:
Locating New Stops in a Railway Network. ATMOS 2001: 13-23 - 2000
- [b2]Horst W. Hamacher, Kathrin Klamroth:
Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook. Vieweg 2000, ISBN 978-3-528-03155-8, pp. 1-240 - [j28]Horst W. Hamacher, Kathrin Klamroth:
Planar Weber location problems with barriers and block norms. Ann. Oper. Res. 96(1-4): 191-208 (2000) - [j27]Emilio Carrizosa, Horst W. Hamacher, Rolf Klein, Stefan Nickel:
Solving Nonconvex Planar Location Problems by Finite Dominating Sets. J. Glob. Optim. 18(2): 195-210 (2000)
1990 – 1999
- 1999
- [j26]Matthias Ehrgott, Horst W. Hamacher, Stefan Nickel:
Geometric Methods to Solve Max-Ordering Location Problems. Discret. Appl. Math. 93(1): 3-20 (1999) - [j25]Horst W. Hamacher, Martine Labbé, Stefan Nickel:
Multicriteria network location problems with sum objectives. Networks 33(2): 79-92 (1999) - 1998
- [j24]Les R. Foulds, Horst W. Hamacher, John M. Wilson:
Integer programming approaches tofacilities layout models with forbidden areas. Ann. Oper. Res. 81: 405-418 (1998) - [j23]Petra Huh, Horst W. Hamacher:
Book reviews. Math. Methods Oper. Res. 47(1): 165-167 (1998) - 1997
- [j22]Horst W. Hamacher, Anita Schöbel:
A note on center problems with forbidden polyhedra. Oper. Res. Lett. 20(4): 165-169 (1997) - 1995
- [b1]Horst W. Hamacher:
Mathematische Lösungsverfahren für planare Standortprobleme. Vieweg 1995, ISBN 978-3-528-06686-4, pp. I-IX, 1-171 - [j21]Horst W. Hamacher:
A note onK best network flows. Ann. Oper. Res. 57(1): 65-72 (1995) - 1994
- [j20]Horst W. Hamacher, Günther Ruhe:
On spanning tree problems with multiple objectives. Ann. Oper. Res. 52(4): 209-230 (1994) - [j19]Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli:
Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24(1): 11-21 (1994) - 1993
- [j18]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): 139-145 (1993) - [j17]Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci:
Preface. Discret. Appl. Math. 47(2): 85 (1993) - [j16]Horst W. Hamacher, Eberhard Triesch:
Book reviews. ZOR Methods Model. Oper. Res. 38(2): 230-233 (1993) - 1991
- [j15]Horst W. Hamacher:
Book review. ZOR Methods Model. Oper. Res. 35(4): 290 (1991) - [j14]Horst W. Hamacher, Franz Rendl:
Color constrained combinatorial optimization problems. Oper. Res. Lett. 10(4): 211-219 (1991) - 1990
- [j13]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): 504-506 (1990)
1980 – 1989
- 1989
- [j12]Horst W. Hamacher, Les R. Foulds:
Algorithms for flows with parametric capacities. ZOR Methods Model. Oper. Res. 33(1): 21-37 (1989) - [j11]Paolo M. Camerini, Horst W. Hamacher:
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking. SIAM J. Discret. Math. 2(1): 16-27 (1989) - 1987
- [j10]Chandra R. Chegireddy, Horst W. Hamacher:
Algorithms for finding K-best perfect matchings. Discret. Appl. Math. 18(2): 155-165 (1987) - 1986
- [j9]Horst W. Hamacher:
Maximal dynamic polymatroid flows and applications. Discret. Appl. Math. 15(1): 41-54 (1986) - 1985
- [j8]Horst W. Hamacher:
A time expanded matroid algorithm for finding optimal dynamic matroid intersections. Z. Oper. Research 29(5): 203-215 (1985) - 1982
- [j7]Horst W. Hamacher:
Decomposition of group flows in regular matroids. Computing 29(2): 113-133 (1982) - [j6]Rainer E. Burkard, Horst W. Hamacher, Jørgen Tind:
On abstract duality in mathematical programming. Z. Oper. Research 26(1): 197-209 (1982) - [j5]Horst W. Hamacher:
Determining minimal cuts with a minimal number of arcs. Networks 12(4): 493-504 (1982) - [j4]Horst W. Hamacher:
An O(K·n4) algorithm for finding the k best cuts in a network. Oper. Res. Lett. 1(5): 186-189 (1982) - [c3]Horst W. Hamacher:
K Best Cuts in Planar and Nonplanar Networks. WG 1982: 79-90 - 1981
- [j3]Helmut Friesdorf, Horst W. Hamacher:
A note on weighted minimal cost flows. Z. Oper. Research 25(1): 45-47 (1981) - [c2]Helmut Friesdorf, Horst W. Hamacher:
A Negative Circuit Algorithm for Weighted Min Cost Flows. WG 1981: 115-126 - 1980
- [j2]Horst W. Hamacher:
Algebraic flows in regular matroids. Discret. Appl. Math. 2(1): 27-38 (1980) - [c1]Horst W. Hamacher:
Optimal (s, t)-Cuts (Extended Abstract). WG 1980: 383-387
1970 – 1979
- 1979
- [j1]Horst W. Hamacher:
Numerical investigations on the maximal flow algorithm of Karzanov. Computing 22(1): 17-29 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
