History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 1095 total

Local search methods for the flowshop scheduling problem with flowtime minimization. (English)
Eur. J. Oper. Res. 222, No. 1, 31-43 (2012).
WorldCat.org
1
A simple and effective metaheuristic for the minimum latency problem. (English)
Eur. J. Oper. Res. 221, No. 3, 513-520 (2012).
WorldCat.org
2
A hybrid algorithm for the heterogeneous fleet vehicle routing problem. (English)
Eur. J. Oper. Res. 221, No. 2, 285-295 (2012).
WorldCat.org
3
Some heuristic methods for solving $p$-median problems with a coverage constraint. (English)
Eur. J. Oper. Res. 220, No. 2, 320-327 (2012).
WorldCat.org
4
A comparison of three metaheuristics for the workover rig routing problem. (English)
Eur. J. Oper. Res. 220, No. 1, 28-36 (2012).
WorldCat.org
5
Local search algorithms for the red-blue median problem. (English)
Algorithmica 63, No. 4, 795-814 (2012).
WorldCat.org
6
Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates. (English)
Comput. Oper. Res. 39, No. 6, 1257-1264 (2012).
WorldCat.org
7
An efficient local search for minimizing completion time variance in permutation flow shops. (English)
Comput. Oper. Res. 39, No. 5, 1000-1009 (2012).
WorldCat.org
8
An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. (English)
Comput. Oper. Res. 39, No. 5, 890-901 (2012).
WorldCat.org
9
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. (English)
Comput. Oper. Res. 39, No. 3, 678-686 (2012).
WorldCat.org
10
An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. (English)
Comput. Oper. Res. 39, No. 2, 449-460 (2012).
WorldCat.org
11
Heuristic solutions to the long-term unit commitment problem with cogeneration plants. (English)
Comput. Oper. Res. 39, No. 2, 269-282 (2012).
WorldCat.org
12
Large neighbourhood search algorithms for the founder sequence reconstruction problem. (English)
Comput. Oper. Res. 39, No. 2, 213-224 (2012).
WorldCat.org
13
An ILS heuristic for the traveling tournament problem with predefined venues. (English)
Ann. Oper. Res. 194, 137-150 (2012).
WorldCat.org
14
A discrete dynamic convexized method for the max-cut problem. (English)
Ann. Oper. Res. 196, 371-390 (2012).
WorldCat.org
15
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan. (English)
Comput. Oper. Res. 39, No. 11, 2880-2887 (2012).
WorldCat.org
16
Computing solutions of the paintshop-necklace problem. (English)
Comput. Oper. Res. 39, No. 11, 2666-2678 (2012).
WorldCat.org
17
A new hybrid genetic algorithm for job shop scheduling problem. (English)
Comput. Oper. Res. 39, No. 10, 2291-2299 (2012).
WorldCat.org
18
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. (English)
Comput. Oper. Res. 39, No. 9, 2152-2160 (2012).
WorldCat.org
19
Variable neighborhood descent with iterated local search for routing and wavelength assignment. (English)
Comput. Oper. Res. 39, No. 9, 2133-2141 (2012).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 1095 total

Valid XHTML 1.0 Transitional Valid CSS!