Pelegrn B.

B. Pelegrn

Information about the author B. Pelegrn will soon be added to the site.
Found 5 papers in total
The maximum capacity shortest path problem: generation of efficient solution sets
The maximum capacity shortest path problem: generation of efficient solution sets
2002
Individual items of flow in a telecommunications or a transportation network may need...
A continuous location model for siting a non-noxious undesirable facility within a geographical region
A continuous location model for siting a non-noxious undesirable facility within a geographical region
2000
The location within a given geographical region of a polluting or an undesirable...
Algorithms for the decomposition of a polygon into convex polygons
Algorithms for the decomposition of a polygon into convex polygons
2000
Decomposing a non-convex polygon into simpler subsets has been a recurrent theme in...
On the sum–max bicriterion path problem
On the sum–max bicriterion path problem
1998
In this paper, we study a special class of bicriterion path problems where the...
The minimum covering lpb-hypersphere problem
The minimum covering lpb-hypersphere problem
1998
The minimum covering hypersphere problem is defined as to find a hypersphere of...
Papers per page: