| 471 | -- | 478 | Rabia Nessah, Imed Kacem. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates |
| 479 | -- | 491 | Thomas Ponsignon, Lars Mönch. Heuristic approaches for master planning in semiconductor manufacturing |
| 492 | -- | 497 | Ji-Bo Wang, Ming-Zheng Wang. Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time |
| 498 | -- | 511 | Jochen Gorski, Luís Paquete, Fábio Pedrosa. Greedy algorithms for a class of knapsack problems with binary weights |
| 512 | -- | 520 | Sayyed Rasoul Mousavi, Farzaneh Tabataba. An improved algorithm for the longest common subsequence problem |
| 521 | -- | 540 | Xiang Li, Gang Du. Inequality constraint handling in genetic algorithms using a boundary simulation method |
| 541 | -- | 559 | Nilay Noyan. Risk-averse two-stage stochastic programming with an application to disaster management |
| 560 | -- | 570 | Ram Ramakrishnan, Ananth Krishnamurthy. Performance evaluation of a synchronization station with multiple inputs and population constraints |
| 571 | -- | 575 | Baruch Mor, Gur Mosheiov. Batch scheduling on uniform machines to minimize total flow-time |
| 576 | -- | 581 | O. T. Kosmas, D. S. Vlachos. Simulated annealing for optimal ship routing |
| 582 | -- | 593 | Rui Xu, Huaping Chen, Xueping Li. Makespan minimization on single batch-processing machine via ant colony optimization |
| 594 | -- | 608 | Pedro Martins. Cliques with maximum/minimum edge neighborhood and neighborhood density |
| 609 | -- | 619 | Chun-An Chou, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Mary V. Ashley. Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction |
| 620 | -- | 628 | Vladimir Marianov, Gabriel Gutiérrez-Jarpa, Carlos Obreque, Oscar Cornejo. Lagrangean relaxation heuristics for the p-cable-trench problem |
| 629 | -- | 636 | Céline Gicquel, L. Hege, Michel Minoux, W. van Canneyt. A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints |
| 637 | -- | 646 | Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura. An LP-based heuristic algorithm for the node capacitated in-tree packing problem |
| 647 | -- | 658 | Yiyong Xiao, Ikou Kaku, Qiuhong Zhao, Ren-qian Zhang. Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems |
| 659 | -- | 663 | Ming-Zheng Wang, Ji-Bo Wang. Single-machine makespan minimization scheduling with nonlinear shortening processing times |
| 664 | -- | 670 | Byungjun You, Takeo Yamada. Shift-and-merge technique for the DP solution of the time-constrained backpacker problem |
| 671 | -- | 677 | Geiza Cristina da Silva, Laura Bahiense, Luiz Satoru Ochi, Paulo Oswaldo Boaventura Netto. The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics |
| 678 | -- | 686 | Stephen C. H. Leung, Yangbin Lin, Defu Zhang. Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem |
| 687 | -- | 697 | Wei-feng Gao, San-yang Liu. A modified artificial bee colony algorithm |
| 698 | -- | 708 | Marie-Laure Bougnol, José H. Dulá, Paul Rouse. Interior point methods in DEA to determine non-zero multiplier weights |
| 709 | -- | 717 | Shunji Tanaka. A heuristic algorithm based on Lagrangian relaxation for the closest string problem |
| 718 | -- | 727 | Dirk Briskorn, Andrei Horbach. A Lagrangian approach for minimum cost single round robin tournaments |
| 728 | -- | 735 | Glaydston Mattos Ribeiro, Gilbert Laporte. An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem |
| 736 | -- | 745 | Sergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey. Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage |
| 746 | -- | 749 | Federico Della Croce, Fabio Salassa. Improved LP-based algorithms for the closest string problem |