Sciweavers

944 search results - page 26 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
EOR
2007
90views more  EOR 2007»
14 years 9 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
SAC
2009
ACM
15 years 4 months ago
Heuristic approach for automated shelf space allocation
Shelf space allocation is the problem of efficiently arranging retail products on shelves in order to maximise profit, improve stock control, improve customer satisfaction, etc. ...
Dario Landa Silva, Fathima Marikar, Khoi Le
COR
2010
152views more  COR 2010»
14 years 10 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
DGO
2003
118views Education» more  DGO 2003»
14 years 11 months ago
Reducing Storage Costs for Federated Search of Text Databases
In environments containing many text search engines a federated search system provides people with a single point of access. When search engines are managed by independent organiz...
Jie Lu, Jamie Callan
HICSS
2006
IEEE
143views Biometrics» more  HICSS 2006»
15 years 3 months ago
Assessment of Enterprise Information Security - The Importance of Information Search Cost
There are today several methods and standards available for assessment of the level of information security in an enterprise. A problem with these assessment methods is that they ...
Erik Johansson, Mathias Ekstedt, Pontus Johnson