|
[1] |
L. Bianchi, J. Knowles, and N. Bowler.
Local search for the probabilistic traveling salesman problem:
Correction to the 2-p-opt and 1-shift algorithms.
European Journal of Operational Research, 2003. In press.
[ bib ] |
|
[2] |
C. Blum.
Beam-ACO-Hybridizing ant colony optimization with beam search:
An application to open shop scheduling.
Computers & Operations Research, 2004. In press.
[ bib | .pdf ] |
|
[3] |
C. Blum and M.J. Blesa.
New metaheuristic approaches for the edge-weighted k-cardinality tree
problem. Computers & Operations Research, 2004. In press.
[ bib | .pdf ] |
|
[4] |
C. Blum and M. Dorigo.
The hyper-cube framework for ant colony optimization.
IEEE Transactions on Systems, Man, and Cybernetics - Part B, 34(2):1161-1172,
2004.
[ bib ] |
|
[5] |
C. Blum and M. Dorigo.
Search bias in ant colony optimization: On the role of
competition-balanced systems.
IEEE Transactions on Evolutionary Computation, 2005. To appear.
[ bib ] |
|
[6] |
C. Blum and A. Roli.
Metaheuristics in combinatorial optimization: Overview and conceptual
comparison.
ACM Computing Surveys, 35(3):268-308, 2003.
[ bib | .pdf ] |
|
[7] |
C. Blum and M. Sampels.
An ant colony optimization algorithm for shop scheduling problems.
Journal of Mathematical Modelling and Algorithms, 2004. In press.
[ bib | .pdf ] |
|
[8] |
G. Bontempi and M. Birattari.
From linearization to lazy learning: a survey of divide-and-conquer
techniques for nonlinear control.
International Journal of Computational Cognition, 3(1):56-73, 2005.
[ bib ] |
|
[9] |
M. Chiarandini, K. Socha, M. Birattari, and O. Rossi-Doria. An effective
hybrid approach for the university course timetabling problem. Journal
of Scheduling, 2003. To appear. Also available as Technical Report AIDA-2003-05,
FG Intellektik, FB Informatik, TU Darmstadt.
[ bib ] |
|
[10] |
F. Comellas and M. Sampels.
Small-world networks: A deterministic approach.
Physica A, 309(1-2):231-235, 2002.
[ bib ] |
|
[11] |
K. Jansen and M. Mastrolilli.
Approximation schemes for parallel machine scheduling problems with
controllable processing times.
Computers & Operations Research, 31:1565-1581, 2003.
[ bib ] |
|
[12] |
K. Jansen, M. Mastrolilli, and R. Solis-Oba. Approximation schemes for
job shop scheduling problems with controllable processing times. European
Journal of Operational Research, 2004. To appear.
[ bib ] |
|
[13] |
H. R. Lourenço, O. Martin, and T. Stützle. A concise introduction
to iterated local search. AIROnews, 2004. To appear.
[ bib ] |
|
[14] |
M. Mastrolilli. Efficient approximation schemes for scheduling problems
with release dates and delivery times. Journal of Scheduling, 6:521-531,
2003.
[ bib ] |
|
[15] |
M. Mastrolilli. Notes on max flow time minimization with controllable processing
times. Computing, 71:375-386, 2003.
[ bib ] |
|
[16] |
M. Mastrolilli. Scheduling to minimize max flow time: Off-line and on-line
algorithms. International Journal of Foundations of Computer Science,
15:385-401, 2004.
[ bib ] |
|
[17] |
M. Mastrolilli. Efficient Approximation Schemes for Scheduling Problems
with Release Dates and Delivery Times. Journal of Scheduling, to appear.
[ bib ] |
|
[18] |
M. Mastrolilli and L. Bianchi. Core instances for testing: a case study. European
Journal of Operational Research, 2004. To appear.
[ bib ] |
|
[19] |
M. Mastrolilli and L. M. Gambardella. Maximum satisfiability: How good
are tabu search and plateau moves in the worst-case? European Journal
of Operational Research, 2004. To appear.
[ bib ] |
|
[20] |
M. Mastrolilli and M. Hutter. Hybrid rounding techniques for knapsack problems. Discrete
Applied Mathematics, 2004. To appear.
[ bib ] |
|
[21] |
N. Meuleau and M. Dorigo. Ant colony optimization and stochastic gradient
descent. Artificial Life, 8(2):103-121, 2002. Also available as technical
report TR/IRIDIA/2000-36, IRIDIA, Université Libre de Bruxelles.
[ bib | .ps.gz | .pdf ] |
|
[22] |
L. Paquete and T. Stützle. A study of local search algorithms for
the biobjective qap with correlated flow matrices. European Journal of
Operational Research, 2004. Accepted for publication.
[ bib ] |
|
[23] |
H. A. Saleh and R. Chelouah. The design of the global navigation satellite
surveying networks using genetic algorithms. Journal of Engineering Applications
of Artificial Intelligence, 17(1):111-122, 2003.
[ bib ] |
|
[24] |
H.A. Saleh. Ants can successfully design gps surveying networks. GPS
World, 13(9):48-60, 2002.
[ bib | .pdf ] |
|
[25] |
H.A. Saleh. Optimal Design for GPS Surveying Networks using Operational
Research. Journal of the Arab Institute of Navigation, 17:31-47, 2002.
[ bib ] |
|
[26] |
H.A. Saleh and P.J. Dare. Effective heuristics for the gps survey network
of malta: Simulated annealing and tabu search techniques. Journal of Heuristics,
7(6):533-549, 2001.
[ bib | .pdf ] |
|
[27] |
H.A. Saleh and P.J. Dare. Heuristic methods for designing global positioning
system surveying network in the republic of seychelles. The Arabian Journal
for Science and Engineering, 26:73-93, 2002.
[ bib | .pdf ] |
|
[28] |
H.A. Saleh and P.J. Dare. Near-optimal design of global positioning system
(gps) networks using tabu search technique. Journal of Global Optimization.,
25:183-208, 2003.
[ bib | .pdf ] |
|
[29] |
T. Schiavinotto and T. Stützle. Search space analisys of the linear
ordering problem. Journal of Mathematical Modelling and Algorithms,
2004. to appear.
[ bib ] |
|
[30]
|
T. Stützle and M. Dorigo.
A short convergence proof for a class of ACO algorithms.
IEEE Transactions on Evolutionary Computation, 6(4):358-365,
2002.
[ bib |
.pdf ]
|
|
[31] |
T. Stützle and S. Linke. Experiments with variants of ant algorithms. Mathware & Soft
Computing, 9(2-3):193-207, 2002.
[ bib | .pdf ] |
|
[32] |
D. Villacci, G. Bontempi, A. Vaccaro, and M. Birattari. The role of learning
methods in the dynamic assessment of power components loading capability. IEEE
Transactions on Industrial Electronics, 2004. To appear.
[ bib ] |
|
[33]
|
M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo.
Model-based search for combinatorial optimization: A critical survey.
Annals of Operations Research, 131(1-4):375-395, 2004.
[ bib ]
|