Sciweavers

1026 search results - page 35 / 206
» An Optimal Solution to Room Search Problem
Sort
View
TEC
2008
150views more  TEC 2008»
15 years 4 months ago
AbYSS: Adapting Scatter Search to Multiobjective Optimization
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to...
Antonio J. Nebro, Francisco Luna, Enrique Alba, Be...
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
15 years 11 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
LION
2007
Springer
100views Optimization» more  LION 2007»
15 years 10 months ago
Nested Partitioning for the Minimum Energy Broadcast Problem
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
Sameh Al-Shihabi, Peter Merz, Steffen Wolf
EOR
2008
91views more  EOR 2008»
15 years 4 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 11 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl