Hamacher Horst W.

Horst W. Hamacher

Information about the author Horst W. Hamacher will soon be added to the site.
Found 23 papers in total
Multiple objective minimum cost flow problems: A review
Multiple objective minimum cost flow problems: A review
2007
In this paper, theory and algorithms for solving the multiple objective minimum cost...
Finding representative systems for discrete bicriterion optimization problems
Finding representative systems for discrete bicriterion optimization problems
2007
Given a discrete bicriterion optimization problem, we propose two box algorithms to...
Integrated scheduling and location models: single machine makespan problems
Integrated scheduling and location models: single machine makespan problems
2007
Scheduling and location models are often used to tackle problems in production,...
Design of zone tariff systems in public transportation
Design of zone tariff systems in public transportation
2004
Given a public transportation system represented by its stops and direct connections...
Algorithms for time-dependent bicriteria shortest path problems
Algorithms for time-dependent bicriteria shortest path problems
2006
In this paper we generalize the classical shortest path problem in two ways. We...
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
2005
In this article, we study the modulation of intensity matrices arising in cancer...
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
2004
In this article the modulation of intensity matrices arising in cancer radiation...
On center cycles in grid graphs
On center cycles in grid graphs
2003
Finding “good” cycles in graphs is a problem of great interest in graph...
Multicriteria semi-obnoxious network location problems with sum and center objectives
Multicriteria semi-obnoxious network location problems with sum and center objectives
2002
Locating a facility is often modeled as either the maxisum or the minisum problem,...
Multicriteria network location problems with sum objectives
Multicriteria network location problems with sum objectives
1999
In this paper, network location problems with several objectives are discussed, where...
Planar Weber location problems with barriers and block norms
Planar Weber location problems with barriers and block norms
2000
The Weber problem for a given finite set of existing facilities ε x = {Ex 1 , Ex...
Heuristics for the k-cardinality tree and subgraph problems
Heuristics for the k-cardinality tree and subgraph problems
1997
In this paper we consider the problem of finding in a given graph a minimal weight...
Geometric methods to solve max-ordering location problems
Geometric methods to solve max-ordering location problems
1999
Location problems with Q (in general conflicting) criteria are considered. After...
Classifiction of location models
Classifiction of location models
1998
There are several good reasons to introduce classification schemes for optimization...
A note on center problems with forbidden polyhedra
A note on center problems with forbidden polyhedra
1997
The problem of finding an optimal location X * minimizing the maximum Euclidean...
Interdisciplinary teaching and regional planning
Interdisciplinary teaching and regional planning
1994
The Interdisciplinary Study Program (MISP, for Modellversuch Interdisziplinares...
A note on K best network flows
A note on K best network flows
1995
It is shown that the problem of finding the K best solutions of a linear integer...
On spanning tree problems with multiple objectives
On spanning tree problems with multiple objectives
1994
The authors investigate two versions of multiple objective minimum spanning tree...
Note on combinatorial optimization with max-linear objective functions
Note on combinatorial optimization with max-linear objective functions
1993
The authors consider combinatorial optimization problems with a feasible solution set...
Sandwich approximation of univariate convex functions with an application to separable convex programming
Sandwich approximation of univariate convex functions with an application to separable convex programming
1991
In this article an algorithm for computing upper and lower approximations of a...
Color constrained combinatorial optimization problems
Color constrained combinatorial optimization problems
1991
The authors consider combinatorial optimization problems in which each feasible...
k-optimal solution sets for some polynomially solvable scheduling problems
k-optimal solution sets for some polynomially solvable scheduling problems
1989
A k-optimal solution set ¦[ ={S 1 ,..., S k } of a given scheduling problem is...
Intersection of two matroids: (Condensed) border graphs and ranking
Intersection of two matroids: (Condensed) border graphs and ranking
1989
Given two matroids M 1 =( E ,ℐ 1 ) and M 2 =( E ,ℐ 2 ), three algorithms for...
Papers per page: