| 1923 | -- | 1937 | Na Li, Zhibin Jiang. Modeling and optimization of a product-service system with additional service capacity and impatient customers |
| 1938 | -- | 1946 | Laurent Alfandari, J. Sadki, A. Plateau, Anass Nagih. Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning |
| 1947 | -- | 1952 | Juyoung Wy, Byung-In Kim. A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem |
| 1953 | -- | 1962 | Fabio Furini, Enrico Malaguti. Models for the two-dimensional two-stage cutting stock problem with multiple stock size |
| 1963 | -- | 1971 | Chih-Chiang Lin, Pi-Chung Wang. A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem |
| 1972 | -- | 1978 | Joe Naoum-Sawaya, Samir Elhedhli. A stochastic optimization model for real-time ambulance redeployment |
| 1979 | -- | 1990 | Selçuk Gören, Henri Pierreval. Taking advantage of a diverse set of efficient production schedules: A two-step approach for scheduling with side concerns |
| 1991 | -- | 2003 | Mohammad Reza Pasandideh, Marc St-Hilaire. Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic |
| 2004 | -- | 2010 | Pasquale Avella, Maurizio Boccia, Igor Vasilyev. Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows |
| 2011 | -- | 2025 | Ting Zhang, George Q. Huang, Ting Qu, Zhi Li 0019. Headquarter-centered common sourcing management through order coordination and consolidation |
| 2026 | -- | 2036 | Pedro Munari, Jacek Gondzio. Using the primal-dual interior point algorithm within the branch-price-and-cut method |
| 2037 | -- | 2050 | Qiong Jia, Yoonho Seo. Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation |
| 2051 | -- | 2061 | Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo Pérez. Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects |
| 2062 | -- | 2070 | Vladimir Beresnev. Branch-and-bound algorithm for a competitive facility location problem |
| 2071 | -- | 2082 | Agnieszka Rudek, Radoslaw Rudek. Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms |
| 2083 | -- | 2093 | Su Nguyen, Mengjie Zhang, Mark Johnston, Kay Chen Tan. Hybrid evolutionary computation methods for quay crane scheduling problems |
| 2094 | -- | 2102 | Hanan Mahmoud, John W. Chinneck. Achieving MILP feasibility quickly using general disjunctions |
| 2103 | -- | 2115 | María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González. The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach |
| 2116 | -- | 2127 | Wen-Hsiang Wu, Jianyou Xu, Wen-Hung Wu, Yunqiang Yin, I.-Fan Cheng, Chin-Chia Wu. A tabu method for a two-agent single-machine scheduling with deterioration jobs |
| 2128 | -- | 2137 | Chung-Cheng Lu, Jiuh-Biing Sheu. Robust vertex p-center model for locating urgent relief distribution centers |
| 2138 | -- | 2144 | Moncer Hariga, Mehmet Gümüs, A. Daghfous, S. K. Goyal. A vendor managed inventory model under contractual storage agreement |
| 2145 | -- | 2160 | Rafael Martinelli, Marcus Poggi, Anand Subramanian. Improved bounds for large scale capacitated arc routing problem |
| 2161 | -- | 2164 | Baruch Mor, Gur Mosheiov, Dvir Shabtay. A note: Minmax due-date assignment problem with lead-time cost |