转发： Computers & Operations Research: Alert 30 July-5 August

[高任飞]

------------------ 原始邮件 ------------------

发件人: "WuJigang";<asjg...@outlook.com>;

发送时间: 2015年8月6日(星期四) 中午11:11

收件人: "高任飞"<9742...@qq.com>;

主题: 转发: Computers & Operations Research: Alert 30 July-5 August

请转发

-----原始邮件-----
发件人: "ScienceDirect Message Center" <val...@prod.sciencedirect.com>
发送时间: ‎2015/‎8/‎5 下午 7:35
收件人: "asj...@gmail.com" <asj...@gmail.com>
主题: Computers & Operations Research: Alert 30 July-5 August


Alert: Computers & Operations Research
New articles available on ScienceDirect


Manage my alerts
Computers & Operations Research
Volume 64 ,  Pages 1-304, December 2015



Title Page/Editorial Board   
Pages i



A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem   Original Research Article
Pages 1-10
Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza


A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows   Original Research Article
Pages 11-27
Çağrı Koç, Tolga Bektaş, Ola Jabali, Gilbert Laporte


Bicriteria scheduling problem for unrelated parallel machines with release dates   Original Research Article
Pages 28-39
Yang-Kuei Lin, Hao-Chen Lin


A dynamic programming algorithm for the Knapsack Problem with Setup   Original Research Article
Pages 40-50
Khalil Chebil, Mahdi Khemakhem


A leader–follower model for discrete competitive facility location   Original Research Article
Pages 51-59
Tammy Drezner, Zvi Drezner, Pawel Kalczynski


Dimensionality reduction in multiobjective shortest path search   Original Research Article
Pages 60-70
Francisco-Javier Pulido, Lawrence Mandow, José-Luis Pérez-de-la-Cruz


Robust energy-aware routing with redundancy elimination   Original Research Article
Pages 71-85
David Coudert, Alvinice Kodjo, Truong Khoa Phan


Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness   Original Research Article
Pages 86-96
Victor Fernandez-Viagas, Jose M. Framinan


A parallel tabu search for solving the primal buffer allocation problem in serial production systems   Original Research Article
Pages 97-112
A. Costa, A. Alfieri, A. Matta, S. Fichera


Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies   Original Research Article
Pages 113-129
Natashia Boland, Thomas Kalinowski, Simranjit Kaur


Optimizing horizontal alignment of roads in a specified corridor   Original Research Article
Pages 130-138
Sukanto Mondal, Yves Lucet, Warren Hare


Approximating the objective function׳s gradient using perceptrons for constrained minimization with application in drag reduction   Original Research Article
Pages 139-158
Burak Kocuk, İ. Kuban Altınel, Necati Aras


On the hop-constrained survivable network design problem with reliable edges   Original Research Article
Pages 159-167
Quentin Botton, Bernard Fortz, Luis Gouveia


The type E simple assembly line balancing problem: A mixed integer linear programming formulation   Original Research Article
Pages 168-177
Rasul Esmaeilbeigi, Bahman Naderi, Parisa Charkhgard


Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation   Original Research Article
Pages 178-188
Borzou Rostami, Federico Malucelli


Time-dependent routing problems: A review   Review Article
Pages 189-197
Michel Gendreau, Gianpaolo Ghiani, Emanuela Guerriero


Improving schedule stability in single-machine rescheduling for new operation insertion   Original Research Article
Pages 198-209
Can Akkan


A bi-level programming model for protection of hierarchical facilities under imminent attacks   Original Resea

[未包含完整的原始邮件。]