Sciweavers

5692 search results - page 90 / 1139
» Challenges and Unsolved Problems
Sort
View
ANOR
2005
72views more  ANOR 2005»
15 years 16 days ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
100
Voted
HEURISTICS
2010
14 years 7 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
CPAIOR
2011
Springer
14 years 4 months ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...
ISMIS
2009
Springer
15 years 7 months ago
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
Wei Gu, Xin Wang, Liqiang Geng
121
Voted
CEC
2008
IEEE
15 years 7 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu