Result 1 to 20 of 140 total
A parallel multi-population biased random-key genetic algorithm for a container loading problem. (English)
Comput. Oper. Res. 39, No. 2, 179-190 (2012).
1
A parallel multi-population biased random-key genetic algorithm for a container loading problem (English)
Computers & OR 39, No. 2, 179-190 (2012).
2
Revised GRASP with path-relinking for the linear ordering problem. (English)
J. Comb. Optim. 22, No. 4, 572-593 (2011).
3
GRASP with path-relinking for the generalized quadratic assignment problem. (English)
J. Heuristics 17, No. 5, 527-565 (2011).
4
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. (English)
J. Heuristics 17, No. 5, 467-486 (2011).
5
Biased random-key genetic algorithms for combinatorial optimization. (English)
J. Heuristics 17, No. 5, 487-525 (2011).
6
GRASP with path relinking heuristics for the antibandwidth problem. (English)
Networks 58, No. 3, 171-189 (2011).
7
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. (English)
J. Comb. Optim. 22, No. 2, 180-201 (2011).
8
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. (English)
Int. Trans. Oper. Res. 18, No. 3, 401-423 (2011).
9
A biased random-key genetic algorithm for routing and wavelength assignment. (English)
J. Glob. Optim. 50, No. 3, 503-518 (2011).
10
An iterative refinement algorithm for the minimum branch vertices problem. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 421-433 (2011).
11
GRASP with path-relinking for data clustering: A case study for biological data. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 410-420 (2011).
12
Experiments with LAGRASP heuristic for set $k$-covering (English)
Optimization Letters 5, No. 3, 407-419 (2011).
13
Restart strategies for GRASP with path-relinking heuristics (English)
Optimization Letters 5, No. 3, 467-478 (2011).
14
Disjoint-path facility location: theory and practice (English)
ALENEX, 60-74 (2011).
15
GRASP with path-relinking for data clustering: A case study for biological data (English)
SEA, 410-420 (2011).
16
An iterative refinement algorithm for the minimum branch vertices problem (English)
SEA, 421-433 (2011).
17
Combining mechanical commutators and semiconductors in fast changing redundant inverter topologies (English)
EUROCON, 1-4 (2011).
18
Solving scalarized multi-objective network flow problems using an interior point method. (English)
Int. Trans. Oper. Res. 17, No. 5, 607-636 (2010).
19
A biased random-key genetic algorithm for road congestion minimization. (English)
Optim. Lett. 4, No. 4, 619-633 (2010).
20
Result 1 to 20 of 140 total