| 2457 | -- | 2468 | Mi-Yi Kim, Young Hoon Lee. MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server |
| 2469 | -- | 2477 | Vidar Gunnerud, Bjarne Foss, K. I. M. McKinnon, B. Nygreen. Oil production optimization solved by piecewise linearization in a Branch & Price framework |
| 2478 | -- | 2487 | Celik Parkan, Jiamin Wang, Desheng Wu, Guiwu Wei. Data envelopment analysis based on maximin relative efficiency criterion |
| 2488 | -- | 2499 | Tal Avinadav, David Sarne. Sequencing counts: A combined approach for sequencing and selecting costly unreliable off-line inspections |
| 2500 | -- | 2519 | Milosz Kadzinski, Salvatore Greco, Roman Slowinski. Selection of a representative set of parameters for robust ordinal regression outranking methods |
| 2520 | -- | 2527 | Wajdi Trabelsi, Christophe Sauvey, Nathalie Sauer. Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems |
| 2528 | -- | 2536 | Raquel J. Fonseca, Berç Rustem. Robust hedging strategies |
| 2537 | -- | 2548 | Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte. The inventory-routing problem with transshipment |
| 2549 | -- | 2563 | Sebastian Henn. Algorithms for on-line order batching in an order picking warehouse |
| 2564 | -- | 2577 | Mojtaba Shakeri, Malcolm Yoke-Hean Low, Stephen John Turner, Eng Wah Lee. A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock |
| 2578 | -- | 2593 | Gabrio Caimi, Martin Fuchsberger, Marco Laumanns, Marco Lüthi. A model predictive control approach for discrete-time rescheduling in complex central railway station areas |
| 2594 | -- | 2602 | Majid Salari, Zahra Naji Azimi. An integer programming-based local search for the covering salesman problem |
| 2603 | -- | 2611 | Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard. A Tabu search algorithm for the network pricing problem |
| 2612 | -- | 2624 | Esra Koca, E. Alper Yildirim. A hierarchical solution approach for a multicommodity distribution problem under a special cost structure |
| 2625 | -- | 2633 | Emilio Carrizosa, Anton Ushakov, Igor Vasilyev. A computational study of a nonlinear minsum facility location problem |
| 2634 | -- | 2641 | Cenk Çaliskan. A faster polynomial algorithm for the constrained maximum flow problem |
| 2642 | -- | 2658 | Reza Kia, Armand Baboli, Nikbakhsh Javadian, Reza Tavakkoli-Moghaddam, Mohammad Kazemi, Javad Khorrami. Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing |
| 2659 | -- | 2665 | Pawel Jan Kalczynski, Jerzy Kamburowski. An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times |
| 2666 | -- | 2678 | Frédéric Meunier, Bertrand Neveu. Computing solutions of the paintshop-necklace problem |
| 2679 | -- | 2687 | Klemens Katterbauer, Ceyda Oguz, F. Sibel Salman. Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem |
| 2688 | -- | 2704 | Tsung-Jung Hsieh, Wei-Chang Yeh. Penalty guided bees search for redundancy allocation problems with a mix of components in series-parallel systems |
| 2705 | -- | 2714 | Maciej Drozdowski, D. Kowalski, J. Mizgajski, D. Mokwa, Grzegorz Pawlak. Mind the gap: A study of Tube tour |
| 2715 | -- | 2724 | Davide Anghinolfi, Giorgio Cannata, Fulvio Mastrogiovanni, Cristiano Nattero, Massimo Paolucci 0002. Heuristic approaches for the optimal wiring in large scale robotic skin design |
| 2725 | -- | 2732 | Hande Yaman, Sourour Elloumi. Star p-hub center problem and star p-hub median problem with bounded path lengths |
| 2733 | -- | 2741 | Dieter Claeys, Bart Steyaert, Joris Walraevens, Koenraad Laevens, Herwig Bruneel. Tail distribution of the delay in a general batch-service queueing model |
| 2742 | -- | 2747 | Cenk Çaliskan. A computational study of the capacity scaling algorithm for the maximum flow problem |
| 2748 | -- | 2762 | Réal André Carbonneau, Gilles Caporossi, Pierre Hansen. Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression |
| 2763 | -- | 2775 | Mario Ventresca. Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem |
| 2776 | -- | 2786 | Rafael A. Melo, Laurence A. Wolsey. MIP formulations and heuristics for two-level production-transportation problems |
| 2787 | -- | 2799 | Frank Mufalli, Rajan Batta, Rakesh Nagi. Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans |
| 2800 | -- | 2819 | Prince Bedell, J. MacGregor Smith. Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems |
| 2820 | -- | 2835 | Tsung-Che Chiang, Li-Chen Fu. Rule-based scheduling in wafer fabrication with due date-based objectives |
| 2836 | -- | 2847 | Gianluca Aloi, R. Musmanno, Pasquale Pace, O. Pisacane. A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks |
| 2848 | -- | 2857 | Jørgen Bang-Jensen, Rune Larsen. Efficient algorithms for real-life instances of the variable size bin packing problem |
| 2858 | -- | 2866 | Stephen E. Wright. New linearizations of quadratic assignment problems |
| 2867 | -- | 2879 | Rafay Ishfaq. LTL logistics networks with differentiated services |
| 2880 | -- | 2887 | Cheng Wang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu. A three-phase algorithm for flowshop scheduling with blocking to minimize makespan |
| 2888 | -- | 2898 | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten. Efficient determination of the k most vital edges for the minimum spanning tree problem |
| 2899 | -- | 2903 | Inmaculada Espejo, Antonio M. Rodríguez-Chía. Corrigendum to "Simultaneous location of a service facility and a rapid transit line" [Computers & Operations Research 38(2) (2011) 525-538] |