Sciweavers

3367 search results - page 21 / 674
» Incremental assignment problem
Sort
View
JCO
2007
123views more  JCO 2007»
14 years 9 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...
CP
2005
Springer
15 years 3 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
OL
2010
185views more  OL 2010»
14 years 8 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
71
Voted
EMO
2009
Springer
219views Optimization» more  EMO 2009»
15 years 4 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
ICTAI
2006
IEEE
15 years 3 months ago
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
Lhassane Idoumghar, René Schott