Result 81 to 100 of 2666 total
Using extended MIP formulations for a production/sequencing and a production/distribution problem. (English)
Mahjoub, Ridha A. (ed.), Progress in combinatorial optimization. Selected papers based on the presentations at the international symposium (ISCO 2010), Hammamet, Tunisia, March 24‒26, 2010. London: ISTE; Hoboken, NJ: John Wiley \& Sons (ISBN 978-1-84821-206-0/hbk). 545-557 (2012).
81
Extended beam search for non-exhaustive state space analysis. (English)
J. Log. Algebr. Program. 81, No. 1, 46-69 (2012).
82
Impact of aggregating supplies from single supplier to a cluster of producers: opportunities for 3PL service providers. (English)
Int. J. Oper. Res. 12, No. 2, 192-206 (2011).
83
Tabu search heuristics for workflow resource allocation simulation optimization. (English)
Concurrency Comput. Pract. Exp. 23, No. 16, 2020-2033 (2011).
84
Local metaheuristics and graph partitioning. (English)
Bichot, Charles-Edmond (ed.) et al., Graph partitioning. Hoboken, NJ: John Wiley \& Sons; London: ISTE (ISBN 978-1-84821-233-6/hbk). 139-161 (2011).
85
Tree based models and algorithms for the preemptive asymmetric stacker crane problem. (English)
RAIRO, Oper. Res. 45, No. 3, 179-207 (2011).
86
Finding a wise group of experts in social networks. (English)
Tang, Jie (ed.) et al., Advanced data mining and applications. 7th international conference, ADMA 2011, Beijing, China, December 17‒19, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-25852-7/pbk). Lecture Notes in Computer Science 7120. Lecture Notes in Artificial Intelligence, 381-394 (2011).
87
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem. (English)
Int. J. Robust Nonlinear Control 21, No. 12, 1434-1451 (2011).
88
Cooperative control of autonomous systems. (English)
Int. J. Robust Nonlinear Control 21, No. 12, 1355-1357 (2011).
89
The reliable facility location problem: formulations, heuristics, and approximation algorithms. (English)
INFORMS J. Comput. 23, No. 3, 470-482 (2011).
90
Color-coding algorithms to the balanced path problem: computational issues. (English)
INFORMS J. Comput. 23, No. 3, 446-459 (2011).
91
Efficient optimization of reliable two-node connected networks: a biobjective approach. (English)
INFORMS J. Comput. 23, No. 3, 430-445 (2011).
92
A parallel algorithm for the vehicle routing problem. (English)
INFORMS J. Comput. 23, No. 2, 315-330 (2011).
93
Hybrid population-based incremental learning using real codes. (English)
Coello Coello, Carlos A. (ed.), Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17‒21, 2011. Selected papers. Berlin: Springer (ISBN 978-3-642-25565-6/pbk). Lecture Notes in Computer Science 6683, 379-391 (2011).
94
Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic. (English)
Coello Coello, Carlos A. (ed.), Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17‒21, 2011. Selected papers. Berlin: Springer (ISBN 978-3-642-25565-6/pbk). Lecture Notes in Computer Science 6683, 76-90 (2011).
95
Look-back techniques for ASP programs with aggregates. (English)
Fundam. Inform. 107, No. 4, 379-413 (2011).
96
The minimum spanning tree problem with conflict constraints and its variations. (English)
Discrete Optim. 8, No. 2, 191-205 (2011).
97
GHS + LEM: Global-best harmony search using learnable evolution models. (English)
Appl. Math. Comput. 218, No. 6, 2558-2578 (2011).
98
Fast regularized linear sampling for inverse scattering problems. (English)
Numer. Linear Algebra Appl. 18, No. 1, 55-68 (2011).
99
Learning heuristic functions for large state spaces. (English)
Artif. Intell. 175, No. 16-17, 2075-2098 (2011).
100
Result 81 to 100 of 2666 total
Start
Contact
Print
General Help
