503 search results - page 37 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
149
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
132
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
133
click to vote
3DIM
2005
IEEE
15 years 9 months ago
2005
IEEE
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
140
click to vote
CATA
2004
15 years 4 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
130
click to vote
ISMIS
2009
Springer
15 years 10 months ago
2009
Springer
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...