Sciweavers

3433 search results - page 203 / 687
» Heuristics for a bidding problem
Sort
View
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 10 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
CEC
2010
IEEE
15 years 7 months ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
JUCS
2008
148views more  JUCS 2008»
15 years 6 months ago
SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
Ana Belén Gil, Raquel Rodríguez, Fra...
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...