default search action
Computers & Operations Research, Volume 69
Volume 69, May 2016
- Jatinder N. D. Gupta, Ezhil Kalaimannan, Seong-Moo Yoo:
A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators. 1-9 - Apurba K. Nandi, Hugh R. Medal:
Methods for removing links in a network to minimize the spread of infections. 10-24 - Tor G. J. Myklebust, M. A. Sharpe, Levent Tunçel:
Efficient heuristic algorithms for maximum utility product pricing problems. 25-39 - Thibaut Vidal:
Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem. 40-47 - Ali Amiri:
Application placement and backup service in computer clustering in Software as a Service (SaaS) networks. 48-55 - Filipe Brandão, João Pedro Pedroso:
Bin packing and related problems: General arc-flow formulation with graph compression. 56-67 - Fabrizio Marinelli, Angelo Parente:
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. 68-78 - Alfredo Moreno, Douglas José Alem, Deisemara Ferreira:
Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics. 79-96 - Peter Fernandes Wanke, Henrique Ewbank, Víctor Leiva, Fernando Rojas:
Inventory management for new products with triangularly distributed demand and lead-time. 97-108 - Ugur Emeç, Bülent Çatay, Burçin Bozkaya:
An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem. 109-125
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.