Sciweavers

4266 search results - page 117 / 854
» The container loading problem
Sort
View
KES
2010
Springer
15 years 28 days ago
Solving real-world vehicle routing problems with time windows using virus evolution strategy
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
Hitoshi Kanoh, Souichi Tsukahara
IAT
2010
IEEE
15 years 14 days ago
Nash Welfare Allocation Problems: Concrete Issues
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of barg...
Antoine Nongaillard, Philippe Mathieu, Patricia Ev...
CONEXT
2006
ACM
15 years 8 months ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...
CSR
2006
Springer
15 years 6 months ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
131
Voted
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 6 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....