Horst W. Hamacher

From MaRDI portal
Person:166234

Available identifiers

zbMath Open hamacher.horst-wWikidataQ1630028 ScholiaQ1630028MaRDI QIDQ166234

List of research outcomes

PublicationDate of PublicationType
Covering edges in networks2023-11-15Paper
Planar multifacility location problems with tree structure and finite dominating sets2019-11-28Paper
On Universal Shortest Paths2019-09-13Paper
Complexity results on planar multifacility location problems with forbidden regions2019-07-10Paper
Minimizing the number of apertures in multileaf collimator sequencing with field splitting2018-10-26Paper
Ranking robustness and its application to evacuation planning2017-11-23Paper
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes2017-07-27Paper
https://portal.mardi4nfdi.de/entity/Q29607372017-02-17Paper
Sink location to find optimal shelters in evacuation planning2016-11-11Paper
Static and dynamic source locations in undirected networks2015-11-06Paper
Rejoinder on: ``Static and dynamic source locations in undirected networks2015-11-06Paper
On the generality of the greedy algorithm for solving matroid base problems2015-09-21Paper
Scheduling two agents on uniform parallel machines with~makespan and cost functions2014-02-05Paper
Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning2013-09-16Paper
The Multi Terminal q-FlowLoc Problem: A Heuristic2011-09-09Paper
On generalized balanced optimization problems2011-03-02Paper
Mathematical optimization in intensity modulated radiation therapy2010-05-10Paper
Minimum cut bases in undirected networks2010-05-05Paper
Capacity inverse minimum cost flow problem2010-03-09Paper
Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem2010-03-08Paper
Stop location design in public transportation networks: covering and accessibility objectives2010-01-29Paper
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width2009-08-14Paper
Design of Zone Tariff Systems in Public Transportation2009-07-17Paper
Mathematical optimization in intensity modulated radiation therapy2009-07-13Paper
A Survey on Multiple Objective Minimum Spanning Tree Problems2009-07-09Paper
THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS2009-06-23Paper
Uncapacitated single and multiple allocation \(p\)-hub center problems2009-04-17Paper
https://portal.mardi4nfdi.de/entity/Q35115202008-07-11Paper
Finding representative systems for discrete bicriterion optimization problems2008-01-21Paper
Algorithms for time-dependent bicriteria shortest path problems2008-01-11Paper
Consecutive Ones Decomposition of Integer Matrices and Applications2007-05-29Paper
Multiple objective minimum cost flow problems: a review2006-11-15Paper
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints2006-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52917282006-05-22Paper
Decomposition of integer matrices and multileaf collimator sequencing2005-12-27Paper
A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy2005-02-23Paper
Adapting polyhedral properties from facility to hub location problems2005-01-31Paper
Minimizing beam-on time in cancer radiation treatment using multileaf collimators2004-08-04Paper
On center cycles in grid graphs2003-11-17Paper
https://portal.mardi4nfdi.de/entity/Q47898462003-07-27Paper
Dominating sets for rectilinear center location problems with polyhedral barriers2003-05-08Paper
Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives2003-05-04Paper
Inverse radiation therapy planning -- a multiple objective optimization approach2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27765972002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27765982002-01-01Paper
Solving nonconvex planar location problems by finite dominating sets2001-03-20Paper
https://portal.mardi4nfdi.de/entity/Q44944542001-02-09Paper
Planar Weber location problems with barriers and block norms2001-01-17Paper
https://portal.mardi4nfdi.de/entity/Q45201042000-12-11Paper
Geometric methods to solve max-ordering location problems2000-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42427791999-08-04Paper
Multicriteria planar location problems1999-02-22Paper
Integer programming approaches to facilities layout models with forbidden areas1998-09-27Paper
https://portal.mardi4nfdi.de/entity/Q42083371998-09-01Paper
A note on center problems with forbidden polyhedra1998-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48890851997-01-12Paper
A note on \(K\) best network flows1996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48657651996-02-28Paper
Combinatorial algorithms for some 1-facility median problems in the plane1995-01-11Paper
On spanning tree problems with multiple objectives1994-12-01Paper
https://portal.mardi4nfdi.de/entity/Q43103161994-10-26Paper
Weighted k‐cardinality trees: Complexity and polyhedral structure1994-05-09Paper
Optimal bin location and sequencing in printed circuit board assembly1993-08-23Paper
Note on combinatorial optimization with max-linear objective functions1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40356371993-05-18Paper
Sandwich approximation of univariate convex functions with an application to separable convex programming1992-06-28Paper
Color constrained combinatorial optimization problems1992-06-26Paper
k-optimal solution sets for some polynomially solvable scheduling problems1989-01-01Paper
Algorithms for flows with parametric capacities1989-01-01Paper
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking1989-01-01Paper
Modeling of building evacuation problems by network flows with side constraints1988-01-01Paper
On the expected value of stochastic linear programs and (dynamic) network flow problems1987-01-01Paper
Algorithms for finding k-best perfect matchings1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37984581987-01-01Paper
Maximal dynamic polymatroid flows and applications1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36880611985-01-01Paper
A time expanded matroid algorithm for finding optimal dynamic matroid intersections1985-01-01Paper
On general decomposition schemes in mathematical programming1985-01-01Paper
Miu Cost Tensions1985-01-01Paper
On finding the K best cuts in a network1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36838481984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36838511984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36613031983-01-01Paper
Decomposition of group flows in regular matroids1982-01-01Paper
Optimal cocircuits in regular matroids and applications1982-01-01Paper
Weighted min cost flows1982-01-01Paper
An O(K.n**4) algorithm for finding the K best cuts in a network1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33169301982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185021982-01-01Paper
On abstract duality in mathematical programming1982-01-01Paper
Determining minimal cuts with a minimal number of arcs1982-01-01Paper
A note on weighted minimal cost flows1981-01-01Paper
Minimal cost flows in regular matroids1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087461981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39126031981-01-01Paper
Algebraic flows in regular matroids1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39224981980-01-01Paper
Numerical investigations on the maximal flow algorithm of Karzanov1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38724251979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41890191979-01-01Paper
Sensitivity analysis in fuzzy linear programming1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38741791978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41566061977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Horst W. Hamacher