Name
Affiliation
Papers
HORST W. HAMACHER
Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany
54
Collaborators
Citations 
PageRank 
84
562
57.39
Referers 
Referees 
References 
819
652
420
Search Limit
100819
Title
Citations
PageRank
Year
Covering edges in networks00.342020
Planar multifacility location problems with tree structure and finite dominating sets.00.342019
Complexity results on planar multifacility location problems with forbidden regions00.342019
Ranking robustness and its application to evacuation planning.00.342018
Minimizing the number of apertures in multileaf collimator sequencing with field splitting.00.342018
Sink location to find optimal shelters in evacuation planning.00.342016
SI: disaster risk management.00.342016
On the generality of the greedy algorithm for solving matroid base problems00.342015
Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning.100.672013
On the generality of the greedy algorithm for solving matroid problems.00.342013
On generalized balanced optimization problems30.452011
The multi terminal q-FlowLoc problem: a heuristic10.402011
Scheduling two agents on uniform parallel machines with makespan and cost functions60.472011
On Universal Shortest Paths.20.372010
Minimum cut bases in undirected networks40.392010
Capacity inverse minimum cost flow problem60.492010
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators30.412009
A Survey on Multiple Objective Minimum Spanning Tree Problems120.572009
The Continuous Stop Location Problem in Public Transportation Networks.131.182009
Valid inequalities for binary linear codes50.462009
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width60.642009
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem50.552009
Mathematical optimization in intensity modulated radiation therapy331.612008
New trends in locational analysis00.342008
Finding representative systems for discrete bicriterion optimization problems271.292007
Multiple objective minimum cost flow problems: A review171.332007
Consecutive Ones Decomposition of Integer Matrices and Applications00.342006
Algorithms for time-dependent bicriteria shortest path problems70.952006
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints161.192006
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy382.532005
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy30.412005
Decomposition of integer matrices and multileaf collimator sequencing442.512005
Decomposition of consecutive-1 matrices and applications00.342004
Design of Zone Tariff Systems in Public Transportation71.472004
Adapting polyhedral properties from facility to hub location problems522.232004
Minimizing beam-on time in cancer radiation treatment using multileaf collimators426.792004
On Center Cycles in Grid Graphs10.352003
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives80.552002
Locating New Stops in a Railway Network.262.682001
Solving Nonconvex Planar Location Problems by Finite Dominating Sets50.762000
Planar Weber Location Problems with Barriers and Block Norms121.292000
Geometric methods to solve max-ordering location problems80.861999
Multicriteria network location problems with sum objectives.151.541999
A note on center problems with forbidden polyhedra70.991997
A note onK best network flows100.821995
On spanning tree problems with multiple objectives586.101994
Note on combinatorial optimization with max-linear objective functions51.991993
Color constrained combinatorial optimization problems10.381991
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)10.351990
Intersection of two matroids: (condensed) border graphs and ranking101.121989
  • 1
  • 2