#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2005

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl
- Discrete Applied Mathematics
- 2008

This paper concerns the reverse 2-median problem on trees and the reverse 1-median problem on graphs that contain exactly one cycle. It is shown that both models under investigation can beâ€¦ (More)

- Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl
- Networks
- 2006

- Rainer E. Burkard, Johannes Hatzl
- Computers & Chemical Engineering
- 2005

In this paper we investigate mixed-integer linear programs for minimizing the makespan of batch processes. Thereby it turns out that some additional valid constraints which were originally given forâ€¦ (More)

- Rainer E. Burkard, Johannes Hatzl
- European Journal of Operational Research
- 2006

In this paper we investigate a heuristic for batch processing problems occurring in the chemical industry, where the objective is to minimize the makespan. Usually, this kind of problem is solvedâ€¦ (More)

- Rainer E. Burkard, Johannes Hatzl
- J. Comb. Optim.
- 2010

This paper deals with facility location problems on graphs with positive and negative vertex weights. We consider two different objective functions: In the first one (MWD) vertices with positiveâ€¦ (More)

- Elisabeth Gassner, Johannes Hatzl
- Computing
- 2008

This paper concerns a domination problem in graphs with parity constraints. The task is to find a subset of the vertices with minimum cost such that for every vertex the number of chosen vertices inâ€¦ (More)

- Johannes Hatzl, Stephan G. Wagner
- Discrete Mathematics
- 2008

We consider various properties of a general parity domination problem: given a graph G, one is looking for a subset S of the vertex set such that the open/closed neighborhood of each vertex containsâ€¦ (More)

- Johannes Hatzl
- CTW
- 2010

- Johannes Hatzl, Toufik Mansour, Mark Shattuck
- J. Math. Model. Algorithms
- 2011

Consider the set S of points in the plane consisting of the ordered pairs (i, j), where 1 6 i 6 m and 1 6 j 6 n. A problem related to the study of segmentation evaluation of visual images concernsâ€¦ (More)

- Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba
- Discrete Applied Mathematics
- 2010

In this paper, we consider the Online Target Date Assignment Problem (OnlineTDAP) with deferral time one and unsplittable requests for general downstream problems, where the downstream cost areâ€¦ (More)