Result 1 to 20 from 2666 total
Column generation based heuristics for a generalized location routing problem with profits arising in space exploration. (English)
Eur. J. Oper. Res. 223, No. 1, 47-59 (2012).
1
Variable neighbourhood structures for cycle location problems. (English)
Eur. J. Oper. Res. 223, No. 1, 15-26 (2012).
2
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. (English)
Eur. J. Oper. Res. 220, No. 1, 58-66 (2012).
3
Two-stage hybrid flow shop scheduling with dynamic job arrivals. (English)
Comput. Oper. Res. 39, No. 7, 1701-1712 (2012).
4
An effective heuristic algorithm for sum coloring of graphs. (English)
Comput. Oper. Res. 39, No. 7, 1593-1600 (2012).
5
New constructive algorithms for leather nesting in the automotive industry. (English)
Comput. Oper. Res. 39, No. 7, 1487-1505 (2012).
6
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria. (English)
Comput. Oper. Res. 39, No. 7, 1382-1393 (2012).
7
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop. (English)
Comput. Oper. Res. 39, No. 7, 1305-1314 (2012).
8
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).
9
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. (English)
Comput. Oper. Res. 39, No. 6, 1236-1244 (2012).
10
An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. (English)
Comput. Oper. Res. 39, No. 6, 1225-1235 (2012).
11
Efficient algorithms for the double traveling salesman problem with multiple stacks. (English)
Comput. Oper. Res. 39, No. 5, 1044-1053 (2012).
12
Improved LP-based algorithms for the closest string problem. (English)
Comput. Oper. Res. 39, No. 3, 746-749 (2012).
13
An LP-based heuristic algorithm for the node capacitated in-tree packing problem. (English)
Comput. Oper. Res. 39, No. 3, 637-646 (2012).
14
Lagrangean relaxation heuristics for the $p$-cable-trench problem. (English)
Comput. Oper. Res. 39, No. 3, 620-628 (2012).
15
A hierarchical algorithm for the planar single-facility location routing problem. (English)
Comput. Oper. Res. 39, No. 2, 461-470 (2012).
16
Heuristic solutions to the long-term unit commitment problem with cogeneration plants. (English)
Comput. Oper. Res. 39, No. 2, 269-282 (2012).
17
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. (English)
Comput. Oper. Res. 39, No. 2, 225-237 (2012).
18
An improved LNS algorithm for real-time vehicle routing problem with time windows. (English)
Comput. Oper. Res. 39, No. 2, 151-163 (2012).
19
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. (English)
Comput. Oper. Res. 39, No. 1, 54-63 (2012).
20
Result 1 to 20 from 2666 total
Start
Contact
Print
General Help
