Sciweavers

421 search results - page 14 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
STACS
2004
Springer
14 years 2 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
CEC
2010
IEEE
13 years 10 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...
HEURISTICS
2010
13 years 6 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
DAC
1999
ACM
14 years 9 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
EOR
2007
89views more  EOR 2007»
13 years 8 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...