Sciweavers

193 search results - page 15 / 39
» Solving the multiple competitive facilities location problem
Sort
View
HPCN
1995
Springer
13 years 11 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
AEI
2004
150views more  AEI 2004»
13 years 7 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
ICASSP
2011
IEEE
12 years 11 months ago
Decentralized support detection of multiple measurement vectors with joint sparsity
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
Qing Ling, Zhi Tian
ALGOSENSORS
2009
Springer
14 years 2 months ago
Self-stabilizing Deterministic Gathering
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
Yoann Dieudonné, Franck Petit