Sciweavers

201
Voted
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
13 years 5 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
102
Voted
CEC
2011
IEEE
13 years 9 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
101
Voted
CPAIOR
2011
Springer
14 years 29 days ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
89
Voted
SIAMJO
2011
14 years 3 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
122
Voted
HEURISTICS
2010
14 years 4 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
102
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 4 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
84
Voted
FSTTCS
2010
Springer
14 years 7 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
155
Voted
SBIA
2010
Springer
14 years 7 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
68
Voted
CORR
2004
Springer
104views Education» more  CORR 2004»
14 years 9 months ago
Inapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems. Contents
Luca Trevisan
70
Voted
4OR
2004
84views more  4OR 2004»
14 years 9 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard