


default search action
Computers & Operations Research, Volume 57
Volume 57, May 2015
- Sara Spangelo, James W. Cutler, Kyle Gilson, Amy Cohn:
Optimization-based scheduling for the single-satellite, multi-ground station communication problem. 1-16 - Eduardo Rodriguez-Tello
, Hillel Romero-Monsivais
, Gabriel Ramírez-Torres, Frédéric Lardeux
:
Tabu search for the cyclic bandwidth problem. 17-32 - Baruch Mor
, Gur Mosheiov:
Scheduling a deteriorating maintenance activity and due-window assignment. 33-40 - Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
:
A DSATUR-based algorithm for the Equitable Coloring Problem. 41-50 - Marcos Antonio Pereira
, Leandro C. Coelho
, Luiz Antonio Nogueira Lorena
, Ligia C. de Souza
:
A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem. 51-59 - Sanjoy Kumar Paul, Ruhul Amin Sarker
, Daryl Essam
:
A disruption recovery plan in a three-stage production-inventory system. 60-72 - Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk:
The service overlay network design problem for interactive internet applications. 73-82 - Antonio Sedeño-Noda
, Andrea Raith
:
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. 83-94 - Efrain Ruiz, Maria Albareda-Sambola
, Elena Fernández
, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. 95-108 - Emilio Carrizosa
, Carmen-Ana Domínguez-Bravo
, Enrique Fernández-Cara
, Manuel Quero
:
A heuristic method for simultaneous tower and pattern-free field optimization on solar power systems. 109-122 - Stephen J. Maher:
A novel passenger recovery approach for the integrated airline recovery problem. 123-137

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.