Horst W. Hamacher

According to our database1, Horst W. Hamacher authored at least 79 papers between 1979 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Covering edges in networks.
Networks, 2020

Complexity results on planar multifacility location problems with forbidden regions.
Math. Methods Oper. Res., 2019

Planar multifacility location problems with tree structure and finite dominating sets.
Discret. Optim., 2019

Ranking robustness and its application to evacuation planning.
Eur. J. Oper. Res., 2018

Minimizing the number of apertures in multileaf collimator sequencing with field splitting.
Discret. Appl. Math., 2018

Sink location to find optimal shelters in evacuation planning.
EURO J. Comput. Optim., 2016

SI: disaster risk management.
EURO J. Comput. Optim., 2016

On the generality of the greedy algorithm for solving matroid base problems.
Discret. Appl. Math., 2015

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning.
Ann. Oper. Res., 2013

On the generality of the greedy algorithm for solving matroid problems.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Scheduling two agents on uniform parallel machines with makespan and cost functions.
J. Sched., 2011

On generalized balanced optimization problems.
Math. Methods Oper. Res., 2011

The Multi Terminal q-FlowLoc Problem: A Heuristic.
Proceedings of the Network Optimization - 5th International Conference, 2011

A separation algorithm for improved LP-decoding of linear block codes.
IEEE Trans. Inf. Theory, 2010

Capacity inverse minimum cost flow problem.
J. Comb. Optim., 2010

Minimum cut bases in undirected networks.
Discret. Appl. Math., 2010

Mathematical optimization in intensity modulated radiation therapy.
Ann. Oper. Res., 2010

On Universal Shortest Paths.
Proceedings of the Operations Research Proceedings 2010, 2010

Multifacility and Restricted Location Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Facilities Layout Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem.
J. Sched., 2009

An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width.
Oper. Res. Lett., 2009

A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators.
INFORMS J. Comput., 2009

New developments on hub location.
Comput. Oper. Res., 2009

Uncapacitated single and multiple allocation p-hub center problems.
Comput. Oper. Res., 2009

The Continuous Stop Location Problem in Public Transportation Networks.
Asia Pac. J. Oper. Res., 2009

Valid inequalities for binary linear codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Survey on Multiple Objective Minimum Spanning Tree Problems.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

New trends in locational analysis.
Comput. Oper. Res., 2008

Finding representative systems for discrete bicriterion optimization problems.
Oper. Res. Lett., 2007

Multiple objective minimum cost flow problems: A review.
Eur. J. Oper. Res., 2007

Consecutive Ones Decomposition of Integer Matrices and Applications.
Electron. Notes Discret. Math., 2006

Algorithms for time-dependent bicriteria shortest path problems.
Discret. Optim., 2006

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
Discret. Appl. Math., 2006

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy.
Networks, 2005

Special section: Using discrete mathematics to model multileaf collimators in radiation therapy.
Discret. Appl. Math., 2005

Decomposition of integer matrices and multileaf collimator sequencing.
Discret. Appl. Math., 2005

Minimizing beam-on time in cancer radiation treatment using multileaf collimators.
Networks, 2004

Design of Zone Tariff Systems in Public Transportation.
Oper. Res., 2004

Decomposition of consecutive-1 matrices and applications.
Electron. Notes Discret. Math., 2004

Adapting polyhedral properties from facility to hub location problems.
Discret. Appl. Math., 2004

OR Spectr., 2003

On Center Cycles in Grid Graphs.
Ann. Oper. Res., 2003

Inverse radiation therapy planning - a multiple objective optimization approach.
Discret. Appl. Math., 2002

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives.
Ann. Oper. Res., 2002

Facility location - applications and theory.
Springer, ISBN: 978-3-540-42172-6, 2002

Locating New Stops in a Railway Network.
Electron. Notes Theor. Comput. Sci., 2001

Solving Nonconvex Planar Location Problems by Finite Dominating Sets.
J. Glob. Optim., 2000

Planar Weber location problems with barriers and block norms.
Ann. Oper. Res., 2000

Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook.
Vieweg, ISBN: 978-3-528-03155-8, 2000

Multicriteria network location problems with sum objectives.
Networks, 1999

Geometric Methods to Solve Max-Ordering Location Problems.
Discret. Appl. Math., 1999

Book reviews.
Math. Methods Oper. Res., 1998

Integer programming approaches tofacilities layout models with forbidden areas.
Ann. Oper. Res., 1998

A note on center problems with forbidden polyhedra.
Oper. Res. Lett., 1997

A note on<i>K</i> best network flows.
Ann. Oper. Res., 1995

Mathematische Lösungsverfahren für planare Standortprobleme.
Vieweg, ISBN: 978-3-528-06686-4, 1995

Weighted <i>k</i>-cardinality trees: Complexity and polyhedral structure.
Networks, 1994

On spanning tree problems with multiple objectives.
Ann. Oper. Res., 1994

Book reviews.
ZOR Methods Model. Oper. Res., 1993

Note on Combinatorial Optimization with Max-Linear Objective Functions.
Discret. Appl. Math., 1993

Discret. Appl. Math., 1993

Color constrained combinatorial optimization problems.
Oper. Res. Lett., 1991

Book review.
ZOR Methods Model. Oper. Res., 1991

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., 1990

Intersection of Two Matroids: (Condensed) Border Graphs and Ranking.
SIAM J. Discret. Math., 1989

Algorithms for flows with parametric capacities.
ZOR Methods Model. Oper. Res., 1989

Algorithms for finding K-best perfect matchings.
Discret. Appl. Math., 1987

Maximal dynamic polymatroid flows and applications.
Discret. Appl. Math., 1986

A time expanded matroid algorithm for finding optimal dynamic matroid intersections.
Z. Oper. Research, 1985

An O(K·n<sup>4</sup>) algorithm for finding the k best cuts in a network.
Oper. Res. Lett., 1982

Determining minimal cuts with a minimal number of arcs.
Networks, 1982

On abstract duality in mathematical programming.
Z. Oper. Research, 1982

Decomposition of group flows in regular matroids.
Computing, 1982

A note on weighted minimal cost flows.
Z. Oper. Research, 1981

A Negative Circuit Algorithm for Weighted Min Cost Flows.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Algebraic flows in regular matroids.
Discret. Appl. Math., 1980

Optimal (s, t)-Cuts (Extended Abstract).
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Numerical investigations on the maximal flow algorithm of Karzanov.
Computing, 1979