| 409 | -- | 419 | Hui Li, Hojjat Adeli, Jie Sun, Jian-Guang Han. Hybridizing principles of TOPSIS with case-based reasoning for business failure prediction |
| 420 | -- | 426 | André Berger, Alexander Grigoriev, Joyce van Loon. Price strategy implementation |
| 427 | -- | 434 | Camelia Al-Najjar, Behnam Malakooti. Hybrid-LP: Finding advanced starting points for simplex, and pivoting LP methods |
| 435 | -- | 449 | Stefan Gollowitzer, Ivana Ljubic. MIP models for connected facility location: A theoretical and computational study |
| 450 | -- | 463 | Alper Murat, Vedat Verter, Gilbert Laporte. A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand |
| 464 | -- | 473 | Luís Henrique Sacchi, Vinícius Amaral Armentano. A computational study of parametric tabu search for 0-1 mixed integer programs |
| 474 | -- | 483 | Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte. A large neighbourhood search heuristic for ship routing and scheduling with split loads |
| 484 | -- | 495 | Luis E. Agustín-Blas, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Ángel M. Pérez-Bellido, Silvia Jiménez-Fernández. Team formation based on group technology: A hybrid grouping genetic algorithm approach |
| 496 | -- | 504 | Jin-Xiao Chen, Mingrong Deng, Sylvain Gingras. A modified super-efficiency measure based on simultaneous input-output projection in data envelopment analysis |
| 505 | -- | 513 | Claudia D Ambrosio, Silvano Martello. Heuristic algorithms for the general nonlinear separable knapsack problem |
| 514 | -- | 516 | Federico Della Croce, Andrea Grosso. Computational experience with a core-based reduction procedure for the 2-knapsack problem |
| 517 | -- | 524 | Amaia Lusa, Rafael Pastor. Planning working time accounts under demand uncertainty |
| 525 | -- | 538 | Inmaculada Espejo, Antonio M. Rodríguez-Chía. Simultaneous location of a service facility and a rapid transit line |
| 539 | -- | 549 | Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy. A branch-and-cut algorithm for the partitioning-hub location-routing problem |
| 550 | -- | 558 | Luis Gouveia, Ana Paias, Stefan Voß. Models for a traveling purchaser problem with additional side-constraints |
| 559 | -- | 570 | Justo Puerto, A. B. Ramos, Antonio M. Rodríguez-Chía. Single-allocation ordered median hub location problems |
| 571 | -- | 581 | Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez. An exact bit-parallel algorithm for the maximum clique problem |
| 582 | -- | 590 | Sung-Seok Ko, Jin-Young Choi, Dong Won Seo. Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy |