


default search action
Computers & Operations Research, Volume 102
Volume 102, February 2019
- Lavinia Amorosi

, Paolo Dell'Olmo
, Giovanni Luca Giacco:
Mathematical Models for On-Line Train Calendars Generation. 1-9 - Okan Örsan Özener, Ali Ekici

, Elvin Çoban
:
Improving blood products supply through donation tailoring. 10-21 - Luis Gouveia

, Markus Leitner
, Mario Ruthmair
:
Layered graph approaches for combinatorial optimization problems. 22-38 - Zhao-Hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li:

Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. 39-51 - Libor Bukata

, Premysl Sucha
, Zdenek Hanzálek
:
Optimizing energy consumption of robotic cells by a Branch & Bound algorithm. 52-66 - Daniel Nicola

, Rudolf Vetschera
, Alina G. Dragomir
:
Total distance approximations for routing solutions. 67-74 - Víctor Blanco

, Alfredo Marín:
Upgrading nodes in tree-shaped hub location. 75-90 - Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus:

The p-arborescence star problem: Formulations and exact solution approaches. 91-101 - Vahid Riahi

, M. A. Hakim Newton
, Kaile Su
, Abdul Sattar
:
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling. 102-120 - Tammy Drezner, Zvi Drezner

, Pawel Jan Kalczynski
:
The planar multifacility collection depots location problem. 121-129 - Roberto Cordone, Pierre Hosteins:

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. 130-140 - Zhen Shang, Songzheng Zhao, Jin-Kao Hao

, Xue Yang, Fuda Ma:
Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables. 141-149 - Tobia Calogiuri

, Gianpaolo Ghiani
, Emanuela Guerriero
, Renata Mansini
:
A branch-and-bound algorithm for the time-Dependent rural postman problem. 150-157

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














