Klinz B.

B. Klinz

Information about the author B. Klinz will soon be added to the site.
Found 5 papers in total
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
1998
A dynamic network consists of a directed graph with a source s, a sink t and...
A process scheduling problem arising from chemical production planning
A process scheduling problem arising from chemical production planning
1998
In this paper we investigate scheduling problems which stem from real-world...
A note on the complexity of the transportation problem with a permutable demand vector
A note on the complexity of the transportation problem with a permutable demand vector
1999
In this note we investigate the computational complexity of the transportation problem...
The computational complexity of the k-minimum spanning tree problem in graded matrices
The computational complexity of the k-minimum spanning tree problem in graded matrices
1998
Given an undirected graph G = ( V, E ) where each edge e = ( i, j ) has...
The quickest flow problem
The quickest flow problem
1993
Consider a network 𝒩=(G,c,τ) where G=(N,A) is a directed graph and c ij and...
Papers per page: