Sciweavers

3433 search results - page 59 / 687
» Heuristics for a bidding problem
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
HEURISTICS
2000
90views more  HEURISTICS 2000»
14 years 9 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
STRINGOLOGY
2004
14 years 11 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
APIN
2005
98views more  APIN 2005»
14 years 9 months ago
3-D Container Packing Heuristics
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a f...
Andrew Lim, Brian Rodrigues, Y. Yang
ECCC
2011
190views ECommerce» more  ECCC 2011»
14 years 1 months ago
Optimal heuristic algorithms for the image of an injective function
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...