Sciweavers

3192 search results - page 170 / 639
» The minimum latency problem
Sort
View
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 5 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 4 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
NETWORKS
2007
15 years 3 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
EUSFLAT
2009
15 years 1 months ago
A Two Step Solution Procedure to a Fuzzy Medical Waste Disposal Facility Location Problem
This paper handles the medical waste disposal facility location problem in Istanbul by using fuzzy TOPSIS (FETOPSIS) to select the adequate place between some candidate points that...
H. Ziya Ulukan, Yesim Kop
FSTTCS
2007
Springer
15 years 10 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...