Volume 37, Number 1, January 2010

• 
  Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia: Scheduling in sports: An annotated bibliography. 1-19

• 
  Brian Q. Rieksts, Jose A. Ventura: Two-stage inventory models with a bi-modal transportation cost. 20-31
• 
  Nils Boysen: Truck scheduling at zero-inventory cross docking terminals. 32-41
• 
  Russell D. Meller, Zeynep Kirkizoglu, Weiping Chen: A new optimization model to support a bottom-up approach to facility design. 42-49
• 
  Jiaquan Gao, Jun Wang: WBMOAIS: A novel artificial immune system for multiobjective optimization. 50-61
• 
  B. Srirangacharyulu, G. Srinivasan: Completion time variance minimization in single machine and multi-machine systems. 62-71
• 
  Ibrahim Akgün, Barbaros Ç. Tansel: Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints. 72-82
• 
  C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. 83-90
• 
  Vincent Raymond, François Soumis, Dominique Orban: A new version of the Improved Primal Simplex for degenerate linear programs. 91-98
• 
  Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu: Improving the discrimination power and weights dispersion in the data envelopment analysis. 99-107
• 
  Charles Bordenave, Michel Gendreau, Gilbert Laporte: Heuristics for the mixed swapping problem. 108-114
• 
  Anita Schöbel, Daniel Scholz: The big cube small cube solution method for multidimensional facility location problems. 115-122
• 
  Alper Murat, Vedat Verter, Gilbert Laporte: A continuous analysis framework for the solution of location-allocation problems with dense demand. 123-136
• 
  Hui Li, Jie Sun: Business failure prediction using hybrid² case-based reasoning (H²CBR). 137-151
• 
  Fardin Ahmadizar, Mehdi Ghazanfari, Seyyed M. T. Fatemi Ghomi: Group shops scheduling with makespan criterion subject to random release dates and processing times. 152-162
• 
  Shimon Abravaya, Michael Segal: Maximizing the number of obnoxious facilities to locate within a bounded region. 163-171
• 
  Bing Han, Jimmy Leblet, Gwendal Simon: Hard multidimensional multiple choice knapsack problems, an empirical study. 172-181
• 
  Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. 182-188
• 
  Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi: Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. 189-198
• 
  Nasser Salmasi, Rasaratnam Logendran, Mohammad Reza Skandari: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. 199-212
• 
  B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh: A contribution and new heuristics for open shop scheduling. 213-221

Volume 37, Number 2, February 2010

• 
  Mohamed Ouzineb, Mustapha Nourelfath, Michel Gendreau: An efficient heuristic for reliability design optimization problems. 223-235
• 
  B. Naderi, Rubén Ruiz, M. Zandieh: Algorithms for a realistic variant of flowshop scheduling. 236-246
• 
  Sameh Al-Shihabi, Sigurdur Ólafsson: A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem. 247-255
• 
  Marcel T. Kalsch, Zvi Drezner: Solving scheduling and location problems in the plane simultaneously. 256-264
• 
  Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin Sicilia, Andreas Nilsson: A new heuristic to solve the one-warehouse N-retailer problem. 265-272
• 
  Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn: A DFO technique to calibrate queueing models. 273-281
• 
  Alex J. Ruiz-Torres, José Humberto Ablanedo-Rosas, Johnny C. Ho: Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility. 282-291
• 
  Antonio J. Lozano, Juan A. Mesa, Frank Plastria: Finding an Euclidean anti-k-centrum location of a set of points. 292-301
• 
  Seong-in Kim, Junghee Han, Youngho Lee, Eunkyung Park: Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum. 302-314
• 
  Jose A. Egea, Rafael Martí, Julio R. Banga: An evolutionary method for complex-process optimization. 315-324
• 
  Shinji Imahori, Mutsunori Yagiura: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. 325-333
• 
  A. Volgenant, C. W. Duin: On a pair of job-machine assignment problems with two stages. 334-340
• 
  Zhaolin Li, Feng Tao: On determining optimal fleet size and vehicle transfer policy for a car rental company. 341-350
• 
  Fabien Tricoire, Martin Romauch, Karl F. Doerner, Richard F. Hartl: Heuristics for the multi-period orienteering problem with multiple time windows. 351-367
• 
  Lixin Tang, Huizhi Ren: Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. 368-375
• 
  Hsiao-Fan Wang, Hsin-Wei Hsu: A closed-loop logistic model with a spanning-tree based genetic algorithm. 376-389
• 
  Eduardo Fernandez, Edy Lopez, Sergio Bernal, Carlos A. Coello Coello, Jorge Navarro: Evolutionary multiobjective optimization using an outranking-based dominance generalization. 390-395
• 
  Yongjun Xiao, Kevin Taaffe: Satisfying market demands with delivery obligations or delivery charges. 396-405
• 
  Gudrun P. Kiesmüller, R. A. C. M. Broekmeulen: The benefit of VMI strategies in a stochastic multi-product serial two echelon system. 406-416
• 
  Wen-Chih Chen, Andrew L. Johnson: A unified model for detecting efficient and inefficient outliers in data envelopment analysis. 417-425

• 
  Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen: Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]. 426-427

Volume 37, Number 3, March 2010

• 
  Christian Blum: Hybrid Metaheuristics. 430-431
• 
  Yannis Marinakis, Magdalene Marinaki: A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem. 432-442
• 
  Panagiotis P. Repoussis, Christos D. Tarantilis, Olli Bräysy, George Ioannou: A hybrid evolution strategy for the open vehicle routing problem. 443-455
• 
  Antoniya Georgieva, Ivan Jordanov: A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points. 456-469
• 
  Luis V. Santana-Quintero, Alfredo García Hernández-Díaz, Julián Molina Luque, Carlos A. Coello Coello, Rafael Caballero: DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems. 470-480
• 
  Manuel Lozano, Carlos García-Martínez: Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. 481-497
• 
  Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte: GRASP and path relinking for the max-min diversity problem. 498-508
• 
  Ling Wang, Quan-Ke Pan, Ponnuthurai N. Suganthan, Wenhong Wang, Ya-Min Wang: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. 509-520
• 
  Thibaut Lust, Andrzej Jaszkiewicz: Speed-up techniques for solving large-scale biobjective TSP. 521-533
• 
  Roberto Battiti, Franco Mascia: Reactive and dynamic local search for max-clique: Engineering effective building blocks. 534-542
• 
  Roberto Montemanni, Derek H. Smith: Heuristic manipulation, tabu search and frequency assignment. 543-551
• 
  Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena: Clustering search algorithm for the capacitated centered clustering problem. 552-558
• 
  Verena Schmid, Karl F. Doerner, Richard F. Hartl, Juan José Salazar González: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. 559-574
• 
  Inmaculada Rodríguez Martín, Juan José Salazar González: A local branching heuristic for the capacitated fixed-charge network design problem. 575-581
• 
  Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: Decomposition, reformulation, and diving in university course timetabling. 582-597
• 
  Matthew R. Gibson, Jeffrey W. Ohlmann, Michael J. Fry: An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition. 598-609

Volume 37, Number 4, April 2010

• 
  Y. Massim, Farouk Yalaoui, Lionel Amodeo, Eric Châtelet, A. Zeblah: Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization. 611-620
• 
  Yaodong Cui, Dao-yun Xu: Strips minimization in two-dimensional cutting stock of circular items. 621-629
• 
  Ana F. Carazo, Trinidad Gómez, Julián Molina Luque, Alfredo García Hernández-Díaz, Flor M. Guerrero, Rafael Caballero: Solving a comprehensive model for multiobjective project portfolio selection. 630-639
• 
  Daniel Tuyttens, A. Vandaele: Using a greedy random adaptative search procedure to solve the cover printing problem. 640-648
• 
  Öncü Hazir, Mohamed Haouari, Erdal Erel: Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version. 649-655
• 
  Xinyu Li, Liang Gao, Xinyu Shao, Chaoyong Zhang, Cuiyu Wang: Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling. 656-667
• 
  Feng Pan, Rakesh Nagi: Robust supply chain design under uncertain demand in agile manufacturing. 668-683
• 
  Deisemara Ferreira, Reinaldo Morabito, Socorro Rangel: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. 684-691
• 
  Luís Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto: Lower bounds for the mixed capacitated arc routing problem. 692-699
• 
  José Rui Figueira, Gabriel Tavares, Margaret M. Wiecek: Labeling algorithms for multiple objective integer knapsack problems. 700-711
• 
  Emmanouil E. Zachariadis, Chris T. Kiranoudis: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. 712-723
• 
  Yuichi Nagata, Olli Bräysy, Wout Dullaert: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. 724-737
• 
  Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez: On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming. 738-753
• 
  B. Naderi, Rubén Ruiz: The distributed permutation flowshop scheduling problem. 754-768
• 
  Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz: A search space "cartography" for guiding graph coloring heuristics. 769-778
• 
  Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan: Bicriteria robotic operation allocation in a flexible manufacturing cell. 779-789
• 
  Jun Woo Kim, Sang-Chan Park: Outsourcing strategy in two-stage call centers. 790-805

Volume 37, Number 5, May 2010

• 
  Jens Clausen, Allan Larsen, Jesper Larsen: Foreword. 807-808
• 
  Jens Clausen, Allan Larsen, Jesper Larsen, Natalia J. Rezanova: Disruption management in the airline industry - Concepts, models and methods. 809-821
• 
  Edmund K. Burke, Patrick De Causmaecker, Geert De Maere, Jeroen Mulder, Marc Paelinck, Greet Vanden Berghe: A multi-objective approach for robust airline scheduling. 822-832
• 
  Oliver Weide, David M. Ryan, Matthias Ehrgott: An iterative approach to robust and integrated aircraft routing and crew scheduling. 833-844
• 
  Natalia J. Rezanova, David M. Ryan: The train driver recovery problem - A set partitioning based model and solution method. 845-856
• 
  Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, André Prigge: Computing delay resistant railway timetables. 857-868
• 
  Satish V. Ukkusuri, Gitakrishnan Ramadurai, Gopal Patil: A robust transportation signal control problem accounting for traffic dynamics. 869-879
• 
  El Houssaine Aghezzaf, Carles Sitompul, Najib M. Najid: Models for robust tactical planning in multi-stage production systems with uncertain demands. 880-889
• 
  Mohamed Ali Aloulou, Christian Artigues: Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case. 890-898
• 
  Singa Wang Chiu: Robust planning in optimization for production system subject to random machine breakdown and failure in rework. 899-908
• 
  A. Volgenant, C. W. Duin: Improved polynomial algorithms for robust bottleneck problems with interval data. 909-915

• 
  Cameron G. Walker, Michael J. O'Sullivan: Core-Edge design of storage area networks - A Single-edge formulation with problem-specific cuts. 916-926
• 
  Jinwei Gu, Manzhan Gu, Cuiwen Cao, Xingsheng Gu: A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. 927-937
• 
  Mateus Rocha de Paula, Geraldo Robson Mateus, Martín Gómez Ravetti: A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times. 938-949
• 
  Ran Liu, Zhibin Jiang, Richard Y. K. Fung, Feng Chen, Xiao Liu: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. 950-959
• 
  Hua Gong, Lixin Tang, C. W. Duin: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. 960-969
• 
  Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. 970-980
• 
  Kaj Holmberg: Heuristics for the rural postman problem. 981-990

Volume 37, Number 6, June 2010

• 
  Rita Macedo, Cláudio Alves, José M. Valério de Carvalho: Arc-flow model for the two-dimensional guillotine cutting stock problem. 991-1001
• 
  Sinan Gürel, Ersin Körpeoglu, M. Selim Aktürk: An anticipative scheduling approach with controllable processing times. 1002-1013
• 
  Niklaus Eggenberg, Matteo Salani, Michel Bierlaire: Constraint-specific recovery network for solving airline recovery problems. 1014-1026
• 
  Yong Xia: An efficient continuation method for quadratic assignment problems. 1027-1032
• 
  Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi: Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem. 1033-1044
• 
  André Rossi, Alok Singh, Marc Sevaux: A metaheuristic for the fixed job scheduling problem under spread time constraints. 1045-1054
• 
  Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic: Variable neighbourhood decomposition search for 0-1 mixed integer programs. 1055-1067
• 
  Duanbing Chen, Jingfa Liu, Yan Fu, Mingsheng Shang: An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem. 1068-1074
• 
  Catia M. S. Machado, Sergio F. Mayerle, Vilmar Trevisan: A linear model for compound multicommodity network flow problems. 1075-1086
• 
  Sarah M. Estelle, Andy L. Johnson, John Ruggiero: Three-stage DEA models for incorporating exogenous inputs. 1087-1090
• 
  Daiki Min, Yuehwern Yih: An elective surgery scheduling problem considering patient priority. 1091-1099
• 
  Mir Saman Pishvaee, Reza Zanjirani Farahani, Wout Dullaert: A memetic algorithm for bi-objective integrated forward/reverse logistics network design. 1100-1112
• 
  Maristela Oliveira Santos, Sadao Massago, Bernardo Almada-Lobo: Infeasibility handling in genetic algorithm using nested domains for production planning. 1113-1122
• 
  T. C. Edwin Cheng, Xiuli Wang: Machine scheduling with job class setup and delivery considerations. 1123-1128
• 
  Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl: Variable neighborhood search for the dial-a-ride problem. 1129-1138
• 
  Yusin Lee, Yen-Ju Lee: A heuristic for retrieving containers from a yard. 1139-1147
• 
  Saadettin Erhan Kesen, Sanchoy K. Das, Zülal Güngör: A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs). 1148-1156

Volume 37, Number 7, July 2010

• 
  Antonis Economou: Algorithmic and computational methods in retrial queues. 1157
• 
  Jesus R. Artalejo, Maria Jesus Lopez-Herrero: Cellular mobile networks with repeated calls operating in random environment. 1158-1166
• 
  Ivan Atencia, I. Fortes, S. Nishimura, S. Sánchez: A discrete-time retrial queueing system with recurrent customers. 1167-1173
• 
  Konstantin Avrachenkov, Uri Yechiali: On tandem blocking queues with a common retrial queue. 1174-1180
• 
  Ioannis Dimitriou, Christos Langaris: A repairable queueing model with two-phase service, start-up times and retrial customers. 1181-1190
• 
  Tien Van Do: An efficient solution to a retrial queue for the performability evaluation of DHCP. 1191-1198
• 
  Antonio Gómez-Corral: On the applicability of the number of collisions in p-persistent CSMA/CD protocols. 1199-1211
• 
  Jeongsim Kim, Bara Kim, Jerim Kim: Moments of the queue size distribution in the MAP/G/1 retrial queue. 1212-1219
• 
  Bara Kim, Jeongsim Kim: Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue. 1220-1227
• 
  Che Soong Kim, Valentina I. Klimenok, Vilena V. Mushko, Alexander N. Dudin: The BMAP/PH/N retrial queueing system operating in Markovian random environment. 1228-1237
• 
  Che Soong Kim, Valentina I. Klimenok, Olga Taramin: A tandem retrial queueing system with two Markovian flows and reservation of channels. 1238-1246
• 
  B. Krishna Kumar, G. Vijayalakshmi, A. Krishnamoorthy, S. Sadiq Basha: A single server feedback retrial queue with collisions. 1247-1255
• 
  Maria Jesus Lopez-Herrero: Waiting time and other first-passage time measures in an (s, S) inventory system with repeated attempts and finite retrial group. 1256-1261
• 
  Yang Woo Shin, Dug Hee Moon: Approximations of retrial queue with limited number of retrials. 1262-1270

• 
  Pavithra Harsha, Cynthia Barnhart, David C. Parkes, Haoqi Zhang: Strong activity rules for iterative combinatorial auctions. 1271-1284
• 
  K. P. Anagnostopoulos, G. Mamanis: A portfolio optimization model with three objectives and discrete variables. 1285-1297
• 
  Ada Barlatt, Amy Mainville Cohn, Oleg Yu. Gusikhin: A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems. 1298-1307
• 
  Johan Oppen, Arne Løkketangen, Jacques Desrosiers: Solving a rich vehicle routing and inventory problem using column generation. 1308-1317
• 
  Ernesto G. Birgin, Jan M. Gentil: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. 1318-1327
• 
  H. M. Soroush: Solving a stochastic single machine problem with initial idle time and quadratic objective. 1328-1347
• 
  Pedro Martins: Extended and discretized formulations for the maximum clique problem. 1348-1358

Volume 37, Number 8, August 2010

• 
  Enza Messina, Marcello Sanguineti: Guest editorial. 1359-1360
• 
  Marco Antoniotti, Marco Carreras, Antonella Farinaccio, Giancarlo Mauri, Daniele Merico, Italo Zoppis: An application of kernel methods to gene cluster temporal meta-analysis. 1361-1368
• 
  Ujjwal Maulik, Anirban Mukhopadhyay: Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data. 1369-1380
• 
  Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce de Leon Ferreira de Carvalho: Investigation of a new GRASP-based clustering algorithm applied to biological data. 1381-1388
• 
  Domenico Conforti, Rosita Guido: Kernel based support vector machine via semidefinite programming: Application to medical diagnosis. 1389-1394
• 
  Francesco Archetti, Ilaria Giordani, Leonardo Vanneschi: Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset. 1395-1405
• 
  Roberto Lucchetti, Stefano Moretti, Fioravante Patrone, Paola Radrizzani: The Shapley and Banzhaf values in microarray games. 1406-1412
• 
  Stefano Moretti: Statistical analysis of the Shapley value for microarray games. 1413-1418
• 
  Paola Bertolazzi, Giovanni Felici, Paola Festa: Logic based methods for SNPs tagging and reconstruction. 1419-1426
• 
  Julio Vera, Carlos González-Alcón, Alberto Marín-Sanguino, Néstor V. Torres: Optimization of biochemical systems through mathematical programming: Methods and applications. 1427-1438

• 
  Imma Ribas, Rainer Leisten, Jose M. Framiñan: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. 1439-1454
• 
  Oded Berman, Jiamin Wang: The network p-median problem with discrete probabilistic demand weights. 1455-1463
• 
  Safia Kedad-Sidhoum, Francis Sourd: Fast neighborhood search for the single machine earliness-tardiness scheduling problem. 1464-1471
• 
  R. Andriansyah, Tom Van Woensel, Frederico R. B. Cruz, Luiz Duczmal: Performance optimization of open zero-buffer multi-server queueing networks. 1472-1487
• 
  Csaba Raduly-Baka, Timo Knuutila, Mika Johnsson, Olli Nevalainen: Construction of component tapes for radial placement machines. 1488-1499
• 
  Leon S. Lasdon, Abraham Duarte, Fred Glover, Manuel Laguna, Rafael Martí: Adaptive memory programming for constrained global optimization. 1500-1509
• 
  Suh-Jenq Yang, Dar-Li Yang, T. C. Edwin Cheng: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. 1510-1514

Volume 37, Number 9, September 2010

• 
  Henrik Andersson, Arild Hoff, Marielle Christiansen, Geir Hasle, Arne Løkketangen: Industrial aspects and literature survey: Combined inventory management and routing. 1515-1536

• 
  Zhixin Liu: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints. 1537-1543
• 
  Daniel T. Wojtaszek, John W. Chinneck: Faster MIP solutions via new node selection rules. 1544-1556
• 
  Francesca Guerriero, L. Talarico: A solution approach to find the critical path in a time-constrained activity network. 1557-1569
• 
  Manuel López-Ibáñez, Christian Blum: Beam-ACO for the travelling salesman problem with time windows. 1570-1583
• 
  Ali Berrichi, Farouk Yalaoui, Lionel Amodeo, M. Mezghiche: Bi-Objective Ant Colony Optimization approach to optimize production and maintenance scheduling. 1584-1596
• 
  Fernando García, Francisco Guijarro, Ismael Moya: A goal programming approach to estimating performance weights for ranking firms. 1597-1609
• 
  Ismael Regis de Farias Jr., Hongxia Zhao, Ming Zhao: A family of inequalities valid for the robust single machine scheduling polyhedron. 1610-1614
• 
  Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen: The dynamic multi-period vehicle routing problem. 1615-1623
• 
  Xianpeng Wang, Lixin Tang: A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times. 1624-1640
• 
  Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland: A strengthened formulation and cutting planes for the open pit mine production scheduling problem. 1641-1647
• 
  Burcu B. Keskin, Sharif H. Melouk, Ivan L. Meyer: A simulation-optimization approach for integrated sourcing and inventory decisions. 1648-1661
• 
  Luc Muyldermans, Gu Pang: A guided local search procedure for the multi-compartment capacitated arc routing problem. 1662-1673

Volume 37, Number 10, October 2010

• 
  Oded Berman, Zvi Drezner, Dmitry Krass: Generalized coverage: New developments in covering location models. 1675-1687

• 
  Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev: A tabu search with an oscillation strategy for the discriminant analysis problem. 1688-1696
• 
  Yan Chen, Shingo Mabu, Kotaro Hirasawa: A model of portfolio optimization using time adapting genetic network programming. 1697-1707
• 
  Srinivas Peeta, F. Sibel Salman, Dilek Gunnec, Kannan Viswanath: Pre-disaster investment decisions for strengthening a highway network. 1708-1719
• 
  N. Rafiee Parsa, Behrooz Karimi, Ali Husseinzadeh Kashan: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. 1720-1730
• 
  Zhe Liang, Wanpracha Art Chaovalitwongse, Meeyoung Cha, Sue B. Moon: Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms. 1731-1739
• 
  Paz Perez-Gonzalez, Jose M. Framiñan: Setting a common due date in a constrained flowshop: A variable neighbourhood search approach. 1740-1748
• 
  Luke Schenk, Diego Klabjan: Intra market optimization for express package carriers with station to station travel and proportional sorting. 1749-1761
• 
  Temel Öncan, Abraham P. Punnen: The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. 1762-1773
• 
  Leizer Lima Pinto, Marta M. B. Pascoal: On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. 1774-1779
• 
  Lixin Tang, Yang Yang, Jiyin Liu: An efficient optimal solution to the coil sequencing problem in electro-galvanizing line. 1780-1796
• 
  Mark H. McElreath, Maria E. Mayorga, Mary E. Kurz: Metaheuristics for assortment problems with multiple quality levels. 1797-1804
• 
  Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi: Near-optimal solutions for the generalized max-controlled set problem. 1805-1813
• 
  Yan Zhang, Zhili Zhou, Jiyin Liu: The production scheduling problem in a multi-page invoice printing system. 1814-1821
• 
  Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. 1822-1832

Volume 37, Number 11, November 2010

• 
  Christian Prins, Nacima Labadi, Caroline Prodhon, Roberto Wolfler Calvo: Metaheuristics for logistics and vehicle routing. 1833-1834
• 
  Faicel Hnaien, Xavier Delorme, Alexandre Dolgui: Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times. 1835-1843
• 
  Boris Bontoux, Christian Artigues, Dominique Feillet: A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem. 1844-1852
• 
  Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden: A Path Relinking approach for the Team Orienteering Problem. 1853-1859
• 
  Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza: The undirected capacitated arc routing problem with profits. 1860-1869
• 
  Pieter Vansteenwegen, Wouter Souffriau, Kenneth Sörensen: Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. 1870-1876
• 
  Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. 1877-1885
• 
  Jorge E. Mendoza, Bruno Castanier, Christelle Guéret, Andrés L. Medaglia, Nubia Velasco: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. 1886-1898
• 
  Anand Subramanian, Lúcia Maria de A. Drummond, Cristiana Bentes, Luiz Satoru Ochi, Ricardo C. Farias: A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. 1899-1911
• 
  Christophe Duhamel, Philippe Lacomme, Christian Prins, Caroline Prodhon: A GRASP×ELS approach for the capacitated location-routing problem. 1912-1923

• 
  Kailiang Xu, Zuren Feng, Keliang Jun: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. 1924-1938
• 
  Prasanna Balaprakash, Mauro Birattari, Thomas Stützle, Marco Dorigo: Estimation-based metaheuristics for the probabilistic traveling salesman problem. 1939-1951
• 
  Zahra Naji Azimi, Majid Salari, Bruce L. Golden, S. Raghavan, Paolo Toth: Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. 1952-1964
• 
  Gur Mosheiov, Assaf Sarig, Jeffrey B. Sidney: The Browne-Yechiali single-machine sequence is optimal for flow-shops. 1965-1967
• 
  Ana de Almeida, Marisa B. Figueiredo: A particular approach for the Three-dimensional Packing Problem with additional constraints. 1968-1976
• 
  Francisco Gortázar, Abraham Duarte, Manuel Laguna, Rafael Martí: Black box scatter search for general classes of binary optimization problems. 1977-1986
• 
  Yingtao Ren, Maged M. Dessouky, Fernando Ordóñez: The multi-shift vehicle routing problem with overtime. 1987-1998
• 
  Rasmus Resen Amossen, David Pisinger: Multi-dimensional bin packing problems with guillotine constraints. 1999-2006
• 
  Huizhen Zhang, Cesar Beltran-Royo, Miguel Constantino: Effective formulation reductions for the quadratic assignment problem. 2007-2016
• 
  Enrico Angelelli, Renata Mansini, Maria Grazia Speranza: Kernel search: A general heuristic for the multi-dimensional knapsack problem. 2017-2026
• 
  Anita Petrick, Jochen Gönsch, Claudius Steinhardt, Robert Klein: Dynamic control mechanisms for revenue management with flexible products. 2027-2039

Volume 37, Number 12, December 2010

• 
  Arild Hoff, Henrik Andersson, Marielle Christiansen, Geir Hasle, Arne Løkketangen: Industrial aspects and literature survey: Fleet composition and routing. 2041-2061

• 
  Imma Ribas, Ramón Companys, Xavier Tort-Martorell: Comparing three-step heuristics for the permutation flow shop problem. 2062-2070
• 
  Xiangyong Li, M. F. Baki, Yash P. Aneja: An ant colony optimization metaheuristic for machine-part cell formation problems. 2071-2081
• 
  Anis Gharbi, Mohamed Labidi: Jackson's semi-preemptive scheduling on a single machine. 2082-2088
• 
  Emmanouil E. Zachariadis, Chris T. Kiranoudis: A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. 2089-2105
• 
  Majid Salari, Paolo Toth, Andrea Tramontani: An ILP improvement procedure for the Open Vehicle Routing Problem. 2106-2120
• 
  Rudolf Vetschera: A general branch-and-bound algorithm for fair division problems. 2121-2130
• 
  Evelina Klerides, Eleni Hadjiconstantinou: A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations. 2131-2140
• 
  Bernat Gacias, Christian Artigues, Pierre Lopez: Parallel machine scheduling with precedence constraints and setup times. 2141-2151
• 
  Ayed A. Salman, Imtiaz Ahmad, Mahamed G. H. Omran, Mohammad Gh. Mohammad: Frequency assignment problem in satellite communications using differential evolution. 2152-2163
• 
  Geraldo R. Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena: A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem. 2164-2172
• 
  Bacel Maddah, Muhammad El-Taha, Roy Abou Tayeh: Optimal allocation of servers and processing time in a load balancing system. 2173-2181
• 
  Burcu Baris Keskin, Halit Üster, Sila Çetinkaya: Integration of strategic and tactical decisions for vendor selection under capacity constraints. 2182-2191
• 
  Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez: Discrepancy search for the flexible job shop scheduling problem. 2192-2201
• 
  Jonathan F. Bard, Narameth Nananukul: A branch-and-price algorithm for an integrated production and inventory routing problem. 2202-2217
• 
  Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron: Optimal due date assignment and resource allocation in a group technology scheduling environment. 2218-2228
• 
  Yi-Kuei Lin, Cheng-Ta Yeh: Optimal resource assignment to maximize multistate network reliability for a computer network. 2229-2238
• 
  Paula Sarabando, Luís Cândido Dias: Simple procedures of choice in multicriteria problems without precise information about the alternatives' values. 2239-2247
• 
  Zhirong Liang, Yanzhi Li, Andrew Lim, Songshan Guo: Load balancing in project assignment. 2248-2256
• 
  Tsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. 2257-2269
• 
  A. M. Benjamin, J. E. Beasley: Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. 2270-2280

last updated on Tue May 21 02:45:42 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page