AG Optimierung

Prof. Dr. Horst W. Hamacher

Anschrift

Paul-Ehrlich-Straße
Gebäude 14 , Raum 461
67663 Kaiserslautern

Postfach 3049
67653 Kaiserslautern

Kontakt

Tel.: +49 631 205 2267
Fax: +49 631 205 4737
E-Mail: hamacher@mathematik.uni-kl.de


  • Minimizing the number of apertures in multileaf collimator sequencing with field splitting
    D. Baatar, M. Ehrgott, H. W. Hamacher, I. M. Raschendorfer,
    Discrete Applied Mathematics (2018)

  • Ranking robustness and its application to evacuation planning
    M. Goerigk, H. W. Hamacher, A. Kinscherff,
    European Journal of Operational Research 264, pp. 837-846 (2018)

  • Sink location to find optimal shelters in evacuation planning
    P. Heßler, H. W. Hamacher,
    EURO Journal on Computational Optimization 4, pp. 325-347 (2016)

  • SI: disaster risk management
    M. Goerigk, H. W. Hamacher,
    EURO Journal on Computational Optimization 4, pp. 215-217 (2016)

  • Static and dynamic source locations in undirected networks
    L. Turner, D P. Gross, H. W. Hamacher, S. O. Krumke,
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 23 (2015)

  • On the generality of the greedy algorithm for solving matroid base problems
    L. Turner, M. Ehrgott, H. W. Hamacher,
    Discrete Applied Mathematics 195, pp. 114-128 (2015)

  • Optimisation models to enhance resilience in evacuation planning
    M. Goerigk, H. W. Hamacher,
    Civil Engineering and Environmental Systems 32, pp. 90-99 (2015)

  • Rejoinder on: Static and dynamic source locations in undirected networks
    L. Turner, D. Groß, H. W. Hamacher, S. O. Krumke,
    TOP 23, pp. 665-668 (2015)

  • Generalized maximum dynamic contraflow on lossy network
    U. Pyakurel, H. W. Hamacher, T. Dhamala,
    International Journal of Operations Research Nepal 3, pp. 27-44 (2014)

  • Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
    H. W. Hamacher, S. Heller, B. Rupp,
    Annals of Operations Research 207, pp. 161-180 (2013)

  • Scheduling two agents on uniform parallel machines with makespan and cost functions
    D. Elvikis, H. W. Hamacher, V. T’kindt,
    Journal of Scheduling 14, pp. 471-481 (2011)

  • On generalized balanced optimization problems
    L. Turner, A. P. Punnen, Y. P. Aneja, H. W. Hamacher,
    Mathematical Methods of Operations Research 73, pp. 19-27 (2011)

  • Minimum cut bases in undirected networks
    F. Bunke, H. W. Hamacher, F. Maffioli, A. M. Schwahn,
    Discrete Applied Mathematics 158, pp. 277-290 (2010)

  • Capacity inverse minimum cost flow problem
    �. Güler, H. W. Hamacher,
    Journal of Combinatorial Optimization 19, pp. 43-59 (2010)

  • Interdisziplinäres Seminar:" Fachdidaktik Chemie und Mathematik"
    Bunke, Hamacher, Hornung, Hürter, Schwahn, Stephani, Wiegering,
    TU Kaiserslautern, Report in Wirtschafts- und Technomathematik an Schulen (WiMS/TeMS Report) (2009)

  • A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators
    D. Baatar, N. Boland, R. Johnston, H. W. Hamacher,
    INFORMS Journal on Computing 21, pp. 224-241 (2009)

  • Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
    D. Elvikis, H. W. Hamacher, M. T. Kalsch,
    Journal of Scheduling 12, pp. 361-374 (2009)

  • An optimal O (nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width
    O. N. Gluchshenko, H. W. Hamacher, A. Tamir,
    Operations Research Letters 37, pp. 168-170 (2009)

  • Stop location design in public transportation networks: covering and accessibility objectives
    D. Groß, H. W. Hamacher, S. Horn, A. Schöbel,
    Top 17, pp. 335 (2009)

  • New developments on hub location
    H. W. Hamacher, T. Meyer,
    Computers and Operations Research 36, pp. 3087 (2009)

  • The continuous stop location problem in public transportation networks
    A. Schöbel, H. W. Hamacher, A. Liebers, D. Wagner,
    Asia-Pacific Journal of Operational Research 26, pp. 13-30 (2009)

  • Uncapacitated single and multiple allocation p-hub center problems
    A. T. Ernst, H. Hamacher, H. Jiang, M. Krishnamoorthy, G. Woeginger,
    Computers & Operations Research 36, pp. 2230-2241 (2009)

  • New developments on hub location
    H. W. Hamacher, T. Meyer,
    Computers and Operations Research 36, pp. 3087 (2009)

  • Mathematical optimization in intensity modulated radiation therapy
    M. Ehrgott, {. Güler, H. W. Hamacher, L. Shao,
    4OR 6, pp. 199-262 (2008)

  • Foreword: New trends in locational analysis
    S. Arifusalem, S. Benati, B. Boffey, T. C{\'a}ceres, D. Cieslik, Z. Drezner, H. A. Eiselt, I. Giannikos, H. W. Hamacher, J. M. Hodgson, others,
    Computers and Operations Research 35, pp. 649-650 (2008)

  • OptionS - Optimierung von Strategien zur langfristigen Umsetzung einer nachhaltigen Siedlungswasserwirtschaft
    T G. Schmitt, H W. Hamacher, I. Kaufmann, M. Kalsch, T. Meyer,
    Abschlussbericht des gleichnamigen Forschungsprojektes gefördert von der Stiftung Rheinland-Pfalz für Innovation, unveröffentlicht (2007)

  • Implementation of sustainable sanitation in existing urban areas-long-term strategies for an optimised solution
    I. Kaufmann, T. Meyer, M. Kalsch, T G. Schmitt, H W. Hamacher,
    Gewässerschutz, Wasser & Abwasser 206, pp. 18 (2007)

  • Finding representative systems for discrete bicriterion optimization problems
    H. W. Hamacher, C. Pedersen, S. Ruzika,
    Operations Research Letters 35, pp. 336-344 (2007)

  • Multiple objective minimum cost flow problems: A review
    H. W. Hamacher, C. Pedersen, S. Ruzika,
    European Journal of Operational Research 176, pp. 1404-1422 (2007)

  • Auf dem Weg zu einer nachhaltigen Siedlungswasserwirtschaft-Optimale Strategien zur Umgestaltung von (Ab) Wassersystemen (Towards sustainable Urban Water Management - Optimised strategies for the transition of (waste) water systems)
    I. Kaufmann, M. Kalsch, T. Meyer, T G. Schmitt, H W. Hamacher,
    siwawi 2030-Themen und Lösungsansätze für die nächsten 25 Jahre 25, pp. 213-247 (2006)

  • An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
    M. Bruglieri, M. Ehrgott, H. W. Hamacher, F. Maffioli,
    Discrete Applied Mathematics 154, pp. 1344-1357 (2006)

  • Algorithms for time-dependent bicriteria shortest path problems
    H. W. Hamacher, S. Ruzika, S. A. Tjandra,
    Discrete optimization 3, pp. 238-254 (2006)

  • Special Section: Multileaf Collimators in Radiation Therapy
    H W. Hamacher, M. Ehrgott, D. Baatar, G J. Woeginger, K. Engel, T. Kalinowski, E A. Canale, J. Gomez, K. Cechlarova, D F. Manlove, others,
    Discrete Applied Mathematics 152 (2005)

  • A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
    R. K. Ahuja, H. W. Hamacher,
    Networks: An International Journal 45, pp. 36-41 (2005)

  • Decomposition of integer matrices and multileaf collimator sequencing
    D. Baatar, H. W. Hamacher, M. Ehrgott, G. J. Woeginger,
    Discrete Applied Mathematics 152, pp. 6-34 (2005)

  • Decomposition of consecutive-1 matrices and applications
    H. W. Hamacher,
    Electronic Notes in Discrete Mathematics, pp. 3 (2004)

  • Minimizing beam-on time in cancer radiation treatment using multileaf collimators
    N. Boland, H. W. Hamacher, F. Lenzen,
    Networks: An International Journal 43, pp. 226-240 (2004)

  • Adapting polyhedral properties from facility to hub location problems
    H. W. Hamacher, M. Labb{\'e}, S. Nickel, T. Sonneborn,
    Discrete Applied Mathematics 145, pp. 104-116 (2004)

  • Design of zone tariff systems in public transportation
    H. W. Hamacher, A. Schöbel,
    Operations Research 52, pp. 897-908 (2004)

  • Minimizing beam-on time in radiation therapy treatment planning using network flows
    R. Ahuja, H. Hamacher,
    submitted to Networks (2003)

  • On center cycles in grid graphs
    L. R. Foulds, H. W. Hamacher, A. Schöbel, T. Yamaguchi,
    Annals of Operations Research 122, pp. 163-175 (2003)

  • Earliest arrival flow model with time dependent capacity for solving evacuation problems
    H. W. Hamacher, S. A. Tjandra,
    Pedestrian and Evacuation Dynamics, pp. 267-276 (2002)

  • Radiation therapy planning—a multicriteria linear programming problem
    H. W. Hamacher, K. Küfer,
    Discrete Appl. Math 118, pp. 145-161 (2002)

  • Dominating sets for rectilinear center location problems with polyhedral barriers
    P M. Dearing, H W. Hamacher, K. Klamroth,
    Naval Research Logistics (NRL) 49, pp. 647-665 (2002)

  • Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
    H. W. Hamacher, M. Labbe, S. Nickel, A. Skriver,
    Annals of Operations Research 110, pp. 33-53 (2002)

  • OR im Krankenhauswesen
    M. Eley, H W. Hamacher, S. Nickel, D. Tenfelde-Podehl,
    OR News, pp. 9-13 (2000)

  • Solving nonconvex planar location problems by finite dominating sets
    E. Carrizosa, H. W. Hamacher, R. Klein, S. Nickel,
    Journal of Global Optimization 18, pp. 195-210 (2000)

  • Planar Weber location problems with barriers and block norms
    H. W. Hamacher, K. Klamroth,
    Annals of Operations Research 96, pp. 191-208 (2000)

  • Multicriteria network location problems with sum objectives
    H. W. Hamacher, M. Labb{\'e}, S. Nickel,
    Networks: An International Journal 33, pp. 79-92 (1999)

  • Integer programming approaches tofacilities layout models with forbidden areas
    L. R. Foulds, H. W. Hamacher, J. M. Wilson,
    Annals of Operations Research 81, pp. 405-418 (1998)

  • Classification of location models
    H. W. Hamacher, S. Nickel,
    Location Science 6, pp. 229-242 (1998)

  • Multicriteria planar location problems
    H W. Hamacher, S. Nickel,
    Location Science 1, pp. 68 (1997)

  • Equivalence of balance points and Pareto solutions in multiple-objective programming
    M. Ehrgott, H. Hamacher, K. Klamroth, S. Nickel, A. Schöbel, M. Wiecek,
    Journal of Optimization Theory and Applications 92, pp. 209-212 (1997)

  • A note on center problems with forbidden polyhedra
    H. W. Hamacher, A. Schöbel,
    Operations research letters 20, pp. 165-169 (1997)

  • Multicriteria planar location problems
    H. W. Hamacher, S. Nickel,
    European Journal of Operational Research 94, pp. 66-86 (1996)

  • Restricted planar location problems and applications
    H. W. Hamacher, S. Nickel,
    Naval Research Logistics (NRL) 42, pp. 967-992 (1995)

  • A note on K best network flows
    H. W. Hamacher,
    Annals of Operations Research 57, pp. 65-72 (1995)

  • Ranking approach to max-ordering combinatorial optimization and network flows
    H. W. Hamacher, C. Husselman,
    Beiträge zur Angewandten Analysis und Informatik-Helmut Brakhage zu Ehren, pp. 97-111 (1994)

  • Matroid intersections with several objectives
    H W. Hamacher,
    ECCO VII, Milan, February 21, pp. 1994 (1994)

  • Weighted k-cardinality trees: Complexity and polyhedral structure
    M. Fischetti, H. W. Hamacher, K. J{\o}rnsten, F. Maffioli,
    Networks 24, pp. 11-21 (1994)

  • Finding placement sequences and bin locations for cartesian robots
    R. L. Francis, H. W. Hamacher, C. Lee, S. Yeralan,
    IIE transactions 26, pp. 47-59 (1994)

  • On spanning tree problems with multiple objectives
    H. W. Hamacher, G. Ruhe,
    Annals of Operations Research 52, pp. 209-230 (1994)

  • Combinatorial algorithms for some 1-facility median problems in the plane
    H. W. Hamacher, S. Nickel,
    European Journal of Operational Research 79, pp. 340-351 (1994)

  • Median location probems with several objectives
    H W. Hamacher, S. Nickel,
    Studies in Locational Analysis 4, pp. 149-153 (1993)

  • Optimal bin location and sequencing in printed circuit board assembly
    L. R. Foulds, H. W. Hamacher,
    European Journal of Operational Research 66, pp. 279-290 (1993)

  • RLP: a program package for solving restricted 1-facility location problems in a user friendly environment
    S. Nickel, H. Hamacher, others,
    European Journal of Operational Research 62, pp. 116-117 (1992)

  • Sandwich approximation of univariate convex functions with an application to separable convex programming
    R. E. Burkard, H. W. Hamacher, G. Rote,
    Naval Research Logistics (NRL) 38, pp. 911-924 (1991)

  • Color constrained combinatorial optimization problems
    H. W. Hamacher, F. Rendl,
    Operations research letters 10, pp. 211-219 (1991)

  • ORSEP (operations research software exchange program)
    H. W. Hamacher,
    European Journal of Operational Research 48, pp. 161-162 (1990)

  • Theoretical and computational aspects of simulated annealing (PJM van laarhoven EHL aarts) and simulated annealing: theory and applications (PJM van laarhoven and EHL aarts)
    H. W. Hamacher,
    SIAM Review 32, pp. 504-506 (1990)

  • k-optimal solution sets for some polynomially solvable scheduling problems
    P. J. Brucker, H. W. Hamacher,
    European journal of operational research 41, pp. 194-202 (1989)

  • Intersection of two matroids:(condensed) border graphs and ranking
    P. M. Camerini, H. W. Hamacher,
    SIAM journal on discrete mathematics 2, pp. 16-27 (1989)

  • Algorithms for flows with parametric capacities
    H. W. Hamacher, L. R. Foulds,
    Zeitschrift für Operations-Research 33, pp. 21-37 (1989)

  • k-optimal solution sets for some polynomially solvable scheduling problems
    P. J. Brucker, H. W. Hamacher,
    European journal of operational research 41, pp. 194-202 (1989)

  • Modeling of building evacuation problems by network flows with side constraints
    W. Choi, H. W. Hamacher, S. Tufekci,
    European Journal of Operational Research 35, pp. 98-110 (1988)

  • Minimal Cost Flow in Processing Networks, A Primal Approach (J. Koene)
    H. W. Hamacher,
    SIAM Review 30, pp. 330 (1988)

  • Algorithms for finding k-best perfect matchings
    C. R. Chegireddy, H. W. Hamacher,
    Discrete applied mathematics 18, pp. 155-165 (1987)

  • On the expected value of stochastic linear programs and (dynamic) network flow problems
    U. Fincke, H. W. Hamacher,
    European journal of operational research 29, pp. 307-316 (1987)

  • On the use of lexicographic min cost flows in evacuation modeling
    H. W. Hamacher, S. Tufekci,
    Naval Research Logistics (NRL) 34, pp. 487-503 (1987)

  • On the expected value of stochastic linear programs and (dynamic) network flow problems
    U. Fincke, H. W. Hamacher,
    European journal of operational research 29, pp. 307-316 (1987)

  • Maximal dynamic polymatroid flows and applications
    H. W. Hamacher,
    Discrete applied mathematics 15, pp. 41-54 (1986)

  • K best solutions to combinatorial optimization problems
    H. W. Hamacher, M. Queyranne,
    Annals of Operations Research 4, pp. 123-143 (1985)

  • Min Cost Tensions
    H. W. Hamacher,
    Journal of Information and Optimization Sciences 6, pp. 285-304 (1985)

  • A time expanded matroid algorithm for finding optimal dynamic matroid intersections
    H. W. Hamacher,
    Zeitschrift für Operations Research 29, pp. 203-215 (1985)

  • Network models of building evacuation problems with flow-dependent exit capacities
    W. Choi, R L. Francis, H. W. Hamacher, S. Tufekci, J P. Brans,
    Operational Research, pp. 1047-1059 (1984)

  • On finding the K best cuts in a network
    H. W. Hamacher, J. Picard, M. Queyranne,
    Operations Research Letters 2, pp. 303-305 (1984)

  • Weighted min cost flows
    H. Friesdorf, H. Hamacher,
    European Journal of operational research 11, pp. 181-192 (1982)

  • Determining minimal cuts with a minimal number of arcs
    H. Hamacher,
    Networks 12, pp. 493-504 (1982)

  • Algebraic flows in regular matroids
    H. Hamacher,
    Discrete Applied Mathematics 2, pp. 27-38 (1980)

Conference Proceedings

  • Decision Support Systems for Urban Evacuation Logistics in Practice
    M. Goerigk, H. W. Hamacher, S. Schmitt,
    The Palgrave Handbook of Humanitarian Logistics and Supply Chain Management, Springer, pp. 523-546 (2018)

  • Library of Location and Layout Algorithms (LoLoLA) and Urban Event Planning
    A. Groß, H. W. Hamacher, A. Maier,
    EUROPEAN WORKING GROUP ON LOCATION ANALYSIS MEETING 2015, pp. 59 (2015)

  • Extended Sink Location Problems
    P. Heßler, H. W. Hamacher,
    EUROPEAN WORKING GROUP ON LOCATION ANALYSIS MEETING 2015, pp. 63 (2015)

  • Von Straßenkarten bis zur Evakuierung von Städten!
    H. W. Hamacher, B. Grün,
    Zukunftsperspektiven des Operations Research, Springer, pp. 203-226 (2014)

  • Merging educational and applied mathematics: the example of locating bus stops
    H. W. Hamacher, J. Kreußler,
    Accepted and presented paper at CERME8 (Congress of European Research in Mathematics Education), Antalya, Turkey (2013)

  • On the generality of the greedy algorithm for solving matroid problems.
    L. Turner, M. Ehrgott, H. W. Hamacher,
    CTW, pp. 217-220 (2013)

  • A multicriteria optimization approach for inverse radiotherapy planning
    K. Küfer, H. W. Hamacher, T. Bortfeld,
    The Use of Computers in Radiation Therapy: XIIIth International Conference Heidelberg, Germany May 22-25, 2000, pp. 26 (2012)

  • A sandwich approach for evacuation time bounds
    H. W. Hamacher, S. Heller, W. Klein, G. Köster, S. Ruzika,
    Pedestrian and Evacuation Dynamics, Springer, pp. 503-513 (2011)

  • Quickest cluster flow problems
    H. W. Hamacher, K. Leiner, S. Ruzika,
    Pedestrian and Evacuation Dynamics, Springer, pp. 327-336 (2011)

  • Bidirectional coupling of macroscopic and microscopic approaches for pedestrian behavior prediction
    A. Kneidl, M. Thiemann, A. Borrmann, S. Ruzika, H. W. Hamacher, G. Köster, E. Rank,
    Pedestrian and Evacuation Dynamics, Springer, pp. 459-470 (2011)

  • On universal shortest paths
    L. Turner, H. W. Hamacher,
    Operations Research Proceedings 2010, Springer, pp. 313-318 (2011)

  • The multi terminal q-FlowLoc problem: A heuristic
    S. Heller, H. W. Hamacher,
    Network Optimization, Springer, pp. 523-528 (2011)

  • Scheduling two interfering job sets on uniform parallel machines with maximum criteria functions
    D. Elvikis, H. W. Hamacher, V. T’kindt,
    International Conference on Project Management and Scheduling, PMS. Tours, France, pp. 179-182 (2010)

  • Optimal relinquishment according to the norwegian petroleum law: A combinatorial optimization approach
    H. W. Hamacher, K. Jörnsten,
    Energy, Natural Resources and Environmental Economics, Springer, pp. 443-457 (2010)

  • Calculating the minimum distance of linear block codes via integer programming
    M. Punekar, F. Kienle, N. Wehn, A. Tanatmis, S. Ruzika, H. W. Hamacher,
    Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on, pp. 329-333 (2010)

  • Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions
    D. Elvikis, H. W. Hamacher, V. T’kindt,
    Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA). Dublin, Ireland, pp. 645-654 (2009)

  • A survey on multiple objective minimum spanning tree problems
    S. Ruzika, H. W. Hamacher,
    Algorithmics of Large and Complex Networks, Springer, pp. 104-116 (2009)

  • Scheduling two interfering job sets on uniform parallel machines with sum and makespan criteria
    D. Elvikis, H. W. Hamacher, V. T’kindt,
    The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp. 17 (2009)

  • Valid inequalities for binary linear codes
    A. Tanatmis, S. Ruzika, H. W. Hamacher, M. Punekar, F. Kienle, N. Wehn,
    IEEE International Symposium on Information Theory, 2009. ISIT 2009., pp. 2216-2220 (2009)

  • Decomposition of matrices and static multileaf collimators: a survey
    M. Ehrgott, H. W. Hamacher, M. Nußbaum,
    Optimization in medicine, Springer, pp. 25-46 (2008)

  • Facilities Layout Problems
    L. R. Foulds, H. W. Hamacher,
    Encyclopedia of Optimization, Springer, pp. 975-979 (2008)

  • Multifacility and Restricted Location Problems
    H. W. Hamacher, S. Nickel,
    Encyclopedia of Optimization, Springer, pp. 2409-2413 (2008)

  • A separation algorithm for improved LP-decoding of linear block codes
    A. Tanatmis, S. Ruzika, H. W. Hamacher, M. Punekar, F. Kienle, N. Wehn,
    5th International Symposium on Turbo Codes and Related Topics, 2008, pp. 37-42 (2008)

  • Hub location’s tool box: Integer programming, heuristics, aggregation, multiobjective optimization
    S. Baumgartner, E. O. Gavriliouk, H. W. Hamacher, T. Meyer, S. Ruzika,
    Extended Abstract, ISOLDE X Meeting, Sevilla, Spain (2005)

  • Facilities layout for social institutions
    H. W. Hamacher, S. Nickel, D. Tenfelde-Podehl,
    Operations Research Proceedings 2001, pp. 229-236 (2002)

  • Multifacility and Restricted Location Problems
    H. W. Hamacher, S. Nickel,
    Encyclopedia of Optimization, Springer, pp. 1614-1618 (2001)

  • A mixed integer programming approach to the multileaf collimator problem
    H. W. Hamacher, F. Lenzen,
    The Use of Computers in Radiation Therapy, Springer, pp. 210-212 (2000)

  • A multicriteria optimization approach for inverse radiotherapy planning
    K. Küfer, H. W. Hamacher, T. Bortfeld,
    The Use of Computers in Radiation Therapy, Springer, pp. 26-28 (2000)

  • A mixed integer programming approach to the multileaf collimator problem
    H. W. Hamacher, F. Lenzen,
    The Use of Computers in Radiation Therapy, Springer, pp. 210-212 (2000)

  • Inverse radiation therapy planning: A multiple objective optimisation approach
    H. W. Hamacher, K. Kuefer,
    Monitoring, Evaluating, Planning Health Services, World Scientific, pp. 177-189 (1999)

  • Modelling ROTASTORE—A Highly Parallel, Short Term Storage System
    H. W. Hamacher, M. C. Müller, S. Nickel,
    Operations Research Proceedings 1998, pp. 513-521 (1999)

  • Pareto Locations on Networks
    H. W. Hamacher, M. Labb{\'e}, S. Nickel,
    Operations Research Proceedings 1997, Springer, pp. 132-137 (1998)

  • On fair zone designs in public transportation
    H. W. Hamacher, A. Schöbel,
    Computer-Aided Transit Scheduling, Springer, pp. 8-22 (1995)

  • Algorithms for Max-Linear and Multi-Criteria Spanning Tree Problems
    H. W. Hamacher, G. Ruhe,
    Operations research'92: extended abstracts of the 17th Symposium on Operations Research, held at the Universität der Bundeswehr Hamburg at August, 25-28, 1992, pp. 124 (1993)

  • Combinatorial Optimization Models Motivated by Robotic Assembly Problems
    H. W. Hamacher,
    Combinatorial Optimization, Springer, pp. 187-198 (1992)

  • On automating robotic assembly workplace planning
    R L. Francis, H W. Hamacher, C Y. Lee, S. Yeralan,
    Research Report 89-7, Department of Industrial and Systems Engineering, University of Florida (1989)

  • Temporally repeated flow algorithms for dynamic min cost flows
    H. W. Hamacher,
    Decision and Control, 1989., Proceedings of the 28th IEEE Conference on, pp. 1142-1146 (1989)

  • On general decomposition schemes in mathematical programming
    R. Burkard, H. Hamacher, J. Tind,
    Mathematical Programming Essays in Honor of George B. Dantzig Part I, Springer, pp. 238-252 (1985)

  • Ranking the cuts and cut-sets of a network
    H W. Hamacher, J-C. Picard, M. Queyranne,
    North-Holland mathematics studies 95, Elsevier, pp. 183-200 (1984)

  • Algebraic flows and time-cost tradeoff problems
    H W. Hamacher, S. Tufekci,
    North-Holland mathematics studies 95, Elsevier, pp. 165-181 (1984)

Books and Chapters

  • Wie Geometrie zu einem anwendungsbezogenen und alltagsrelevanten Mathematikunterricht beitragen kann
    J. Kreußler, H. W. Hamacher,
    Universitätsbibliothek Dortmund, (2013)

  • Motivationssteigerung im Geometrieunterricht anhand von Modellierung kompetitiver Standortplanung
    J. Kreußler, F. Bunke, H. W. Hamacher,
    Universitätsbibliothek Dortmund, (2012)

  • Combinatorial optimization: new frontiers in theory and practice
    M. Akgül, H. W. Hamacher, S. Tüfekçi,
    Springer Science & Business Media, 82 (2012)

  • Flach spielen, hoch gewinnen: Fußball und Wissenschaft
    H. W. Hamacher, S. Ruzika,
    Shaker, (2010)

  • Flach spielen, hoch gewinnen: Fußball und Wissenschaft
    H. W. Hamacher, S. Ruzika,
    Shaker, (2010)

  • Die Kunst des Modellierens
    H. Hamacher, K. Klamroth, C. Tammer,
    Vieweg+Teubner,, pp. 139-156 (2008)

  • Wirtschaftsmathematik gehört in die Schule!?
    F. Bunke, H. W. Hamacher,
    Universitätsbibliothek Dortmund, (2007)

  • Lineare Optimierung und Netzwerkoptimierung
    H. W. Hamacher, K. Klamroth,
    Springer, (2006)

  • Vernetzung und Individualität
    H. W. Hamacher,
    Shaker, (2006)

  • Mathe und Ökonomie: neue Ideen für den praxisnahen Unterricht
    H. W. Hamacher,
    Universum-Verlag, (2004)

  • Facility location: Applications and Theory
    Z. Drezner, H. W. Hamacher,
    Springer Science & Business Media, (2004)

  • Logistik-just in time!?
    H. W. Hamacher,
    Shaker, (2003)

  • Facility location: Applications and Theory.
    Z. Drezner, H. W. Hamacher,
    Springer, (2002)

  • Gentechnologie-Fluch oder Segen?: Modellierung im interdisziplinären Studienprogramm
    H. W. Hamacher,
    Shaker, (2002)

  • Zwischen betriebswirtschaftlichen Zwängen und sozialen Anforderungen: das Krankenhaus der Zukunft?!
    H. W. Hamacher,
    Shaker, (2001)

  • Education: private or public affair?
    H. W. Hamacher,
    Shaker-Verlag, (1997)

  • Öffentlicher Nahverkehr und Abfallwirtschaft im kommunalen Umfeld
    H. W. Hamacher,
    Shaker, (1996)

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

  • Optimierungsverfahren für wirtschaftliche Probleme: der Natur (wissenschaft) abgeschaut
    H. W. Hamacher,
    Univ., Fachbereich Mathematik, (1993)

  • Approximation of convex functions and application to separable convex programming
    R. E. Burkard, H. W. Hamacher, G. Rothe,
    Universität Kaiserslautern. Fachbereich Mathematik, (1989)

  • Approximation of convex functions and applications in mathematical programming
    R. E. Burkard, H. W. Hamacher, G. Rote,
    Techn. Univ. Graz, (1987)

  • Applications of Combinatorial Methods in Mathematical Programming
    A. Bachem, H. W. Hamacher,
    North-Holland, (1986)

  • Flows in regular matroids
    H. Hamacher,
    Verlagsgruppe Athenäum, Hain, Hanstein, 69 (1981)
Zum Seitenanfang