The following pages link to Horst W. Hamacher (Q166234):
Displayed 50 items.
- On spanning tree problems with multiple objectives (Q1339178) (← links)
- Combinatorial algorithms for some 1-facility median problems in the plane (Q1342072) (← links)
- Joint performance of greedy heuristics for the integer knapsack problem (Q1343153) (← links)
- Inverse radiation therapy planning -- a multiple objective optimization approach (Q1348260) (← links)
- A note on center problems with forbidden polyhedra (Q1362521) (← links)
- Combinatorial engineering of decomposable systems (Q1381552) (← links)
- On center cycles in grid graphs (Q1413759) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Medial axis optimal locations for min-max sphere packing (Q1592843) (← links)
- Planar Weber location problems with barriers and block norms (Q1593532) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
- Ranking robustness and its application to evacuation planning (Q1681390) (← links)
- Minimizing the number of apertures in multileaf collimator sequencing with field splitting (Q1801051) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587) (← links)
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives (Q1872011) (← links)
- A note on \(K\) best network flows (Q1897375) (← links)
- A flexible approach to location problems (Q1974022) (← links)
- Efficient heuristics for orientation metric and Euclidean Steiner tree problems (Q1977863) (← links)
- On shortest \(k\)-edge-connected Steiner networks in metric spaces (Q1977864) (← links)
- Steiner \(k\)-edge connected subgraph polyhedra (Q1977866) (← links)
- Planar multifacility location problems with tree structure and finite dominating sets (Q2010913) (← links)
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem (Q2268516) (← links)
- Capacity inverse minimum cost flow problem (Q2268762) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- Optimal bin location and sequencing in printed circuit board assembly (Q2367380) (← links)
- Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Decomposition of integer matrices and multileaf collimator sequencing (Q2576339) (← links)
- (Q2776597) (← links)
- (Q2776598) (← links)
- (Q2960737) (← links)
- The Multi Terminal q-FlowLoc Problem: A Heuristic (Q3091535) (← links)
- (Q3316930) (← links)
- (Q3318502) (← links)
- Consecutive Ones Decomposition of Integer Matrices and Applications (Q3439523) (← links)
- (Q3511520) (← links)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- (Q3661303) (← links)
- (Q3683848) (← links)
- (Q3683851) (← links)
- (Q3688061) (← links)
- A time expanded matroid algorithm for finding optimal dynamic matroid intersections (Q3698812) (← links)
- On general decomposition schemes in mathematical programming (Q3716854) (← links)