Sciweavers

2108 search results - page 174 / 422
» Constrained Heuristic Search
Sort
View
234
Voted
AAAI
1994
15 years 8 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
EOR
2007
111views more  EOR 2007»
15 years 7 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
AE
2007
Springer
16 years 1 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
165
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 1 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
AE
2005
Springer
16 years 17 days ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...