Sciweavers

4377 search results - page 131 / 876
» Mass problems and randomness
Sort
View
EVOW
2008
Springer
15 years 8 months ago
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke,...
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
MOR
2000
162views more  MOR 2000»
15 years 6 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
VTC
2010
IEEE
125views Communications» more  VTC 2010»
15 years 4 months ago
Solving the Coupon Collector's Problem for the Safety Beaconing in the IEEE 802.11p WAVE
—For the WAVE applications built on safety beacons, it is imperative that the neighboring vehicle information be collected as quickly and efficiently as possible. But the unreli...
Hyundoc Seo, Sangki Yun, Hyogon Kim
ANTSW
2010
Springer
15 years 4 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...