| 2533 | -- | 2552 | Rapeepan Pitakaso, Christian Almeder, Karl F. Doerner, Richard F. Hartl. A MAX-MIN ant system for unconstrained multi-level lot-sizing problems |
| 2553 | -- | 2561 | Marta I. Velazco Fontova, Aurelio R. L. Oliveira, Christiano Lyra. Warm start by Hopfield neural networks for interior point methods |
| 2562 | -- | 2575 | Johnny C. Ho, Adriano O. Solis, Yih-Long Chang. An evaluation of lot-sizing heuristics for deteriorating inventory in material requirements planning systems |
| 2576 | -- | 2588 | K. F. C. Yiu, K. L. Mak, Henry Y. K. Lau. A heuristic for the label printing problem |
| 2589 | -- | 2603 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi. Two- and three-dimensional parametric packing |
| 2604 | -- | 2624 | Antonio Alonso-Ayuso, Laureano F. Escudero, M. Teresa Ortuño, C. Pizarro. On a stochastic sequencing and scheduling problem |
| 2625 | -- | 2636 | Lixin Tang, Hua Xuan, Jiyin Liu. Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling |
| 2637 | -- | 2647 | Edward Bernroider, Volker Stix. A method using weight restrictions in data envelopment analysis for ranking and validity issues in decision making |
| 2648 | -- | 2656 | Rakesh Kawatra. A hop constrained min-sum arborescence with outage costs |
| 2657 | -- | 2673 | Mhand Hifi, M. Michrafy. Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem |
| 2674 | -- | 2694 | Matthias Ehrgott, Xavier Gandibleux. Bound sets for biobjective combinatorial optimization problems |
| 2695 | -- | 2708 | Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena. Lagrangean relaxation with clusters and column generation for the manufacturer s pallet loading problem |
| 2709 | -- | 2717 | Pablo Guerrero-García, Ángel Santos-Palomo. On Hoffman s celebrated cycling LP example |
| 2718 | -- | 2733 | Hua Xuan, Lixin Tang. Scheduling a hybrid flowshop with batch production at the last stage |
| 2734 | -- | 2742 | Feiyue Li, Bruce L. Golden, Edward A. Wasil. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem |
| 2743 | -- | 2757 | Jari Kytöjoki, Teemu Nuortio, Olli Bräysy, Michel Gendreau. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems |
| 2758 | -- | 2773 | Tinglong Dai, Xiangtong Qi. An acquisition policy for a multi-supplier system with a finite-time horizon |
| 2774 | -- | 2789 | Sinan Gurel, M. Selim Akturk. Scheduling parallel CNC machines with time/cost trade-off considerations |
| 2790 | -- | 2804 | Jorge Riera-Ledesma, Juan José Salazar González. A branch-and-cut algorithm for the continuous error localization problem in data cleaning |
| 2805 | -- | 2823 | Deniz Aksen. Loss of customer goodwill in the uncapacitated lot-sizing problem |
| 2824 | -- | 2839 | C. W. Duin. Two fast algorithms for all-pairs shortest paths |
| 2840 | -- | 2848 | Rabia Nessah, Chengbin Chu, Farouk Yalaoui. An exact method for P::m::/sds, r::i::/sum(i=1, n, C::i::) problem |
| 2849 | -- | 2864 | Chae Y. Lee, Ho Dong Kim. Reliable overlay multicast trees for private Internet broadcasting with multiple sessions |