default search action
Computers & Operations Research, Volume 50
Volume 50, October 2014
- Lin Zhu, Louis-Martin Rousseau, Walter Rei, Bo Li:
Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands. 1-13 - Hesam Shams, Nasser Salmasi:
Parallel machine scheduling problem with preemptive jobs and transportation delay. 14-23 - Bjorn P. Berg, Brian T. Denton, S. Ayca Erdogan, Thomas Rohleder, Todd R. Huschka:
Optimal booking and scheduling in outpatient procedure centers. 24-37 - Jelmer P. van der Gaast, Cornelius A. Rietveld, Adriana F. Gabor, Yingqian Zhang:
A Tabu Search Algorithm for application placement in computer clustering. 38-46 - Hongyun Xu, Zhipeng Lü, Aihua Yin, Liji Shen, Udo Buscher:
A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. 47-60 - Mohammad Fattahi, Masoud Mahootchi, Hadi Mosadegh, F. Fallahi:
A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours. 61-79 - Elham Nabipoor Afruzi, Amir Abbas Najafi, Emad Roghanian, Mostafa Mazinani:
A Multi-Objective Imperialist Competitive Algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations. 80-96 - Mauro Russo, Antonio Sforza, Claudio Sterle:
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems. 97-114 - Yu-Jun Zheng, Hai-Feng Ling, Jin-Yun Xue:
Ecogeography-based optimization: Enhancing biogeography-based optimization with ecogeographic barriers and differentiations. 115-127 - Pengyu Yan, Ada Che, Xiaoqiang Cai, Xiaowo Tang:
Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance. 128-140 - Charles Gauvin, Guy Desaulniers, Michel Gendreau:
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. 141-153 - Gianpaolo Ghiani, Emanuela Guerriero:
A lower bound for the quickest path problem. 154-160 - Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
A branch-and-cut algorithm for the hub location and routing problem. 161-174
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.