default search action
Computers & Operations Research, Volume 97
Volume 97, September 2018
- Hipólito Hernández-Pérez, Juan José Salazar González, Beatriz Santos-Hernández:
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem. 1-17 - Yongliang Lu, Una Benlic, Qinghua Wu:
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. 18-30 - Nader Ghaffari-Nasab:
An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. 31-47 - Konstantin Pavlikov:
Improved formulations for minimum connectivity network interdiction problems. 48-57 - Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples. 58-71 - Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Finding exact solutions for the Geometric Firefighter Problem in practice. 72-83 - Kagan Gokbayrak:
Robust gateway placement in wireless mesh networks. 84-95 - Nha Vo-Thanh, Raf Jans, Eric D. Schoen, Peter Goos:
Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs. 96-110 - Troels Martin Range, Dawid Kozlowski, Niels Christian Petersen:
A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs. 111-124 - Iman Roozbeh, Melih Ozlen, John W. Hearne:
An Adaptive Large Neighbourhood Search for asset protection during escaped wildfires. 125-134
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.