The following pages link to Horst W. Hamacher (Q166234):
Displaying 50 items.
- (Q339936) (redirect page) (← links)
- Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- On the expected value of stochastic linear programs and (dynamic) network flow problems (Q579134) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- (Q587049) (redirect page) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- (Q689141) (redirect page) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- On finding the K best cuts in a network (Q792224) (← links)
- Monotonicity of polymatroids (Q796543) (← links)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568) (← links)
- Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Rejoinder on: ``Static and dynamic source locations in undirected networks'' (Q889103) (← links)
- Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- (Q1013400) (redirect page) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- (Q1060223) (redirect page) (← links)
- An elementary proof that every matroid is an intersection of principal transversal matroids (Q1060224) (← links)
- Maximal dynamic polymatroid flows and applications (Q1077321) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Linear objective functions on certain classes of greedoids (Q1082346) (← links)
- Algorithms for finding k-best perfect matchings (Q1090343) (← links)
- Modeling of building evacuation problems by network flows with side constraints (Q1098760) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids (Q1124594) (← links)
- Algebraic flows in regular matroids (Q1138993) (← links)
- (Q1163562) (redirect page) (← links)
- Decomposition of group flows in regular matroids (Q1163563) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Weighted min cost flows (Q1168883) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Color constrained combinatorial optimization problems (Q1178732) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- Submodular functions and optimization (Q1188800) (← links)
- Design of survivable networks (Q1202193) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Numerical investigations on the maximal flow algorithm of Karzanov (Q1255886) (← links)
- Sensitivity analysis in fuzzy linear programming (Q1258687) (← links)
- A characterization of certain excluded-minor classes of matroids (Q1263591) (← links)
- Integer programming approaches to facilities layout models with forbidden areas (Q1265901) (← links)
- Multicriteria planar location problems (Q1278273) (← links)
- Geometric methods to solve max-ordering location problems (Q1289016) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
