Sciweavers

840 search results - page 29 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
ICEC
1996
123views more  ICEC 1996»
14 years 7 days ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
EOR
2006
118views more  EOR 2006»
13 years 11 months ago
Multi-objective tabu search using a multinomial probability mass function
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Nor...
DAM
2006
132views more  DAM 2006»
13 years 11 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
EMO
2009
Springer
235views Optimization» more  EMO 2009»
14 years 5 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
ACL
1990
14 years 3 days ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong