Volume 39, Number 1, January 2012

• 
  Mhand Hifi, Rym M'Hallah: Special issue on knapsack problems and applications. 1-2
• 
  Haibo Wang, Gary A. Kochenberger, Fred Glover: A computational study on the quadratic knapsack problem with multiple constraints. 3-11
• 
  Lucas Létocart, Anass Nagih, Gérard Plateau: Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. 12-18
• 
  Raymond R. Hill, Yong Kun Cho, James T. Moore: Problem reduction heuristic for the 0-1 multidimensional knapsack problem. 19-26
• 
  Federico Della Croce, Andrea Grosso: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. 27-31
• 
  Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut: Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. 32-41
• 
  Vincent Boyer, Didier El Baz, Moussa Elkihel: Solving knapsack problems on GPU. 42-47
• 
  Mohammad Dolatabadi, Andrea Lodi, Michele Monaci: Exact algorithms for the two-dimensional guillotine knapsack. 48-53
• 
  Ali Khanafer, François Clautiaux, El-Ghazali Talbi: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. 54-63
• 
  Stephen C. H. Leung, Defu Zhang, Changle Zhou, Tao Wu: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. 64-73
• 
  Leonardo Junqueira, Reinaldo Morabito, Denise Sato Yamashita: Three-dimensional container loading models with cargo stability and load bearing constraints. 74-85
• 
  Victor C. B. Camargo, Leandro Mattiolli, Franklina Maria Bragion Toledo: A knapsack problem as a tool to solve the production planning problem in small foundries. 86-92
• 
  Lauren Davis, Funda Samanlioglu, Xiaochun Jiang, Daniel Mota, Paul Stanfield: A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP). 93-104
• 
  Bin Zhang: Capacity-constrained multiple-market price discrimination. 105-111
• 
  Ping-Teng Chang, Jung-Hua Lee: A fuzzy DEA and knapsack formulation integrated model for project selection. 112-125

Volume 39, Number 2, February 2012

• 
  Anthony Chen, Zhong Zhou, Xiangdong Xu: A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem. 127-138
• 
  Douglas José Alem, Reinaldo Morabito: Production planning in furniture settings via robust optimization. 139-150
• 
  Lianxi Hong: An improved LNS algorithm for real-time vehicle routing problem with time windows. 151-163
• 
  Xiaoyan Zhu, Wilbert E. Wilhelm: A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation. 164-178
• 
  José Fernando Gonçalves, Mauricio G. C. Resende: A parallel multi-population biased random-key genetic algorithm for a container loading problem. 179-190
• 
  Sajid Siraj, Ludmil Mikhailov, John A. Keane: Enumerating all spanning trees for pairwise comparisons. 191-199
• 
  Thiago A. de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, Eduardo C. Xavier: Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. 200-212
• 
  Andrea Roli, Stefano Benedettini, Thomas Stützle, Christian Blum: Large neighbourhood search algorithms for the founder sequence reconstruction problem. 213-224
• 
  M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel: Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. 225-237
• 
  Sayyed Rasoul Mousavi, Navid Nasr Esfahani: A GRASP algorithm for the Closest String Problem using a probability-based heuristic. 238-248
• 
  Pablo A. Maya, Kenneth Sörensen, Peter Goos: A metaheuristic for a teaching assistant assignment-routing problem. 249-258
• 
  A. G. Lagodimos, I. T. Christou, K. Skouri: Optimal (r, nQ, T) batch ordering with quantized supplies. 259-268
• 
  Niels Hvidberg Kjeldsen, Marco Chiarandini: Heuristic solutions to the long-term unit commitment problem with cogeneration plants. 269-282
• 
  Qinghua Wu, Jin-Kao Hao: Coloring large graphs based on independent set extraction. 283-290
• 
  Remco Germs, Boris Goldengorin, Marcel Turkensteen: Lower tolerance-based Branch and Bound algorithms for the ATSP. 291-298
• 
  Florian Forster, Andreas Bortfeldt: A tree search procedure for the container relocation problem. 299-309
• 
  Naveen Kumar, Jin-Hwan Borm, Ajay Kumar: Reliability analysis of waste clean-up manipulator using genetic algorithms and fuzzy methodology. 310-319
• 
  Tamás Kis, András Kovács: A cutting plane approach for integrated planning and scheduling. 320-327
• 
  Po-Chien Tsai, Jia-Yen Huang: Two-stage replenishment policies for deteriorating items at Taiwanese convenience stores. 328-338
• 
  Yu-Wang Chen, Yong-Zai Lu, Ming Ge, Genke Yang, Changchun Pan: Development of hybrid evolutionary algorithms for production scheduling of hot strip mill. 339-349
• 
  Anastasios Xanthopoulos, Dimitrios Vlachos, Eleftherios Iakovou: Optimal newsvendor policies for dual-sourcing supply chains: A disruption risk management framework. 350-357
• 
  Ali R. Güner, Alper Murat, Ratna Babu Chinnam: Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. 358-373
• 
  Amina Haned, Ameur Soukhal, Mourad Boudhar, Nguyen Huynh Tuong: Scheduling on parallel machines with preemption and transportation delays. 374-381
• 
  Mohamed Bendraouche, Mourad Boudhar: Scheduling jobs on identical machines with agreement graph. 382-390
• 
  Jorge Riera-Ledesma, Juan José Salazar González: Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. 391-404
• 
  Dvir Shabtay, Shlomo Karhi: Online scheduling of two job types on a set of multipurpose machines with unit processing times. 405-412
• 
  Hendrik Baumann, Werner Sandmann: Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. 413-423
• 
  Birkan Can, Cathal Heavey: A comparison of genetic programming and artificial neural networks in metamodeling of discrete-event simulation models. 424-436
• 
  Hande Küçükaydin, Necati Aras, I. Kuban Altinel: A leader-follower game in competitive facility location. 437-448
• 
  Ling Wang, Chen Fang: An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. 449-460
• 
  S. M. H. Manzour-al-Ajdad, S. A. Torabi, S. Salhi: A hierarchical algorithm for the planar single-facility location routing problem. 461-470

Volume 39, Number 3, March 2012

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

Volume 39, Number 4, April 2012

• 
  Desheng Dash Wu, David L. Olson, John R. Birge: Guest editorial. 751-752
• 
  Philipp Aigner, Georg Beyschlag, Tim Friederich, Markus Kalepky, Rudi Zagst: Modeling and managing portfolios including listed private equity. 753-764
• 
  Sung Ho Ha, Ramayya Krishnan: Predicting repayment of the credit card debt. 765-773
• 
  Julie J. C. H. Ryan, Thomas A. Mazzuchi, Daniel J. Ryan, Juliana Lopez de la Cruz, Roger M. Cooke: Quantifying information security risks using expert judgment elicitation. 774-784
• 
  Ester Gutiérrez, Sebastián Lozano: A competing risks analysis of the duration of federal target funds rates. 785-791
• 
  Santiago Carrillo-Menéndez, Alberto Suárez: Robust quantification of the exposure to operational risk: Bringing economic sense to economic capital. 792-804
• 
  Ozden Ustun, Refail Kasimbeyli: Combined forecasts in portfolio optimization: A generalized approach. 805-819
• 
  Janko Hernández, David Saunders, Luis Seco: Algorithmic estimation of risk factors in financial markets with stochastic drift. 820-828
• 
  Chen Chen, Roy H. Kwon: Robust portfolio selection for index tracking. 829-837
• 
  João Claro, Jorge Pinho de Sousa: A multiobjective metaheuristic for a mean-risk multistage capacity investment problem with process flexibility. 838-849
• 
  Amanda J. Schmitt, Lawrence V. Snyder: Infinite-horizon models for inventory control under yield uncertainty and disruptions. 850-862
• 
  J. Tinguaro Rodríguez, Begoña Vitoriano, Javier Montero: A general methodology for data-based rule building and its application to natural disaster management. 863-873

Volume 39, Number 5, May 2012

• 
  Kate Smith-Miles, Leo Lopes: Measuring instance difficulty for combinatorial optimization problems. 875-889
• 
  Chen Fang, Ling Wang: An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. 890-901
• 
  Joaquim A. S. Gromicho, Jelke J. van Hoorn, A. L. Kok, J. M. J. Schutten: Restricted dynamic programming: A flexible framework for solving realistic VRPs. 902-909
• 
  A. L. Kok, E. W. Hans, J. M. J. Schutten: Vehicle routing under time-dependent travel times: The impact of congestion avoidance. 910-918
• 
  Jeffrey E. Schaller, Jorge M. S. Valente: Minimizing the weighted sum of squared tardiness on a single machine. 919-928
• 
  Wenming Zhang, Yinfeng Xu, Feifeng Zheng, Yucheng Dong: Online algorithms for the multiple time series search problem. 929-938
• 
  Shiqing Yao, Zhibin Jiang, Na Li: A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. 939-951
• 
  Xiao-Bing Hu, Mark S. Leeson, Evor L. Hines: An effective genetic algorithm for network coding. 952-963
• 
  Olivia J. Smith, Natashia Boland, Hamish Waterer: Solving shortest path problems with a weight constraint and replenishment arcs. 964-984
• 
  Adam N. Letchford, Sebastian J. Miller: Fast bounding procedures for large instances of the Simple Plant Location Problem. 985-990
• 
  Stephen Mahar, Peter A. Salzarulo, P. Daniel Wright: Using online pickup site inclusion policies to manage demand in retail/E-tail organizations. 991-999
• 
  Peeyush Mehta, Pushkar Pandit, Deepu Philip, Prabha Sharma: An efficient local search for minimizing completion time variance in permutation flow shops. 1000-1009
• 
  Rudolf Vetschera, Adiel Teixeira de Almeida: A PROMETHEE-based approach to portfolio selection problems. 1010-1020
• 
  Thomas Volling, Derya Eren Akyol, Kai Wittek, Thomas Spengler: A two-stage bid-price control for make-to-order revenue management. 1021-1032
• 
  Boris Detienne, Stéphane Dauzère-Pérès, Claude Yugma: An exact approach for scheduling jobs with regular step cost functions on a single machine. 1033-1043
• 
  Marco Casazza, Alberto Ceselli, Marc Nunkesser: Efficient algorithms for the double traveling salesman problem with multiple stacks. 1044-1053
• 
  Behnam Behdani, YoungSang Yun, J. Cole Smith, Ye Xia: Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks. 1054-1061
• 
  Jian-Bo Yang, Dong-Ling Xu, Shanlin Yang: Integrated efficiency and trade-off analyses using a DEA-oriented interactive minimax reference point approach. 1062-1073
• 
  Günes Erdogan, Maria Battarra, Gilbert Laporte, Daniele Vigo: Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. 1074-1086
• 
  Dvir Shabtay, Nufar Gasper: Two-machine flow-shop scheduling with rejection. 1087-1096
• 
  Vera C. Hemmelmayr, Verena Schmid, Christian Blum: Variable neighbourhood search for the variable sized bin packing problem. 1097-1108
• 
  Yunqiang Yin, Chin-Chia Wu, Wen-Hsiang Wu, Shuenn-Ren Cheng: The single-machine total weighted tardiness scheduling problem with position-based learning effects. 1109-1116
• 
  Der-Chiang Li, Chiao-Wen Liu, Tung-Liang Chen: Recursive operation time maximization model for the maintenance of power generation equipment. 1117-1121
• 
  Asvin Goel, Claudia Archetti, Martin W. P. Savelsbergh: Truck driver scheduling in Australia. 1122-1132
• 
  Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez: An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. 1133-1144
• 
  Xianhui Zeng, Wai-Keung Wong, Sunney Yung-Sun Leung: An operator allocation optimization model for balancing control of the hybrid assembly lines using Pareto utility discrete differential evolution algorithm. 1145-1159
• 
  Zhishuang Yao, Szu Hui Ng, Loo Hay Lee: A study on bunker fuel management for the shipping liner services. 1160-1172
• 
  Humberto Heluane, Aníbal M. Blanco, María Rosa Hernández, J. Alberto Bandoni: Simultaneous re-design and scheduling of multiple effect evaporator systems. 1173-1186
• 
  Mohamed Haouari, Anis Kooli, Emmanuel Néron: Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. 1187-1194

Volume 39, Number 6, June 2012

• 
  Alexander A. Lazarev, Vincent T'Kindt, Frank Werner: Guest Editorial. 1195-1196
• 
  Bahriye Cesaret, Ceyda Oguz, F. Sibel Salman: A tabu search algorithm for order acceptance and scheduling. 1197-1205
• 
  T. C. Edwin Cheng, Bertrand M. T. Lin, H. L. Huang: Resource-constrained flowshop scheduling with separate resource recycling operations. 1206-1212
• 
  Federico Della Croce, Thierry Garaix, Andrea Grosso: Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. 1213-1217
• 
  Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich: Single machine scheduling with precedence constraints and positionally dependent processing times. 1218-1224
• 
  Timur Keskintürk, Mehmet B. Yildirim, Mehmet Barut: An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. 1225-1235
• 
  Jacques Lamothe, François Marmier, Matthieu Dupuy, Paul Gaborit, Lionel Dupont: Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. 1236-1244
• 
  U. V. Manoj, Chelliah Sriskandarajah, Edouard Wagneur: Coordination in a two-stage production system: Complexity, conflict and cooperation. 1245-1256
• 
  Mohamed Ali Rakrouki, Talel Ladhari, Vincent T'Kindt: Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates. 1257-1264
• 
  Ruslan Sadykov: A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. 1265-1270
• 
  Yuri N. Sotskov, T.-C. Lai: Minimizing total weighted flow time under uncertainty using dominance and a stability box. 1271-1289
• 
  Serdar Yildiz, Oya Ekin Karasan, M. Selim Akturk: An analysis of cyclic scheduling problems in robot centered cells. 1290-1299
• 
  Chuanli Zhao, Hengyong Tang: A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity. 1300-1303

Volume 39, Number 7, July 2012

• 
  Ahmed El-Bouri: A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop. 1305-1314
• 
  Zhicong Zhang, Li Zheng, Na Li, Weiping Wang, Shouyan Zhong, Kaishun Hu: Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning. 1315-1324
• 
  R. Sakiani, S. M. T. Fatemi Ghomi, M. Zandieh: Multi-objective supply planning for two-level assembly systems with stochastic lead times. 1325-1332
• 
  Haitao Li, Dali Jiang: New model and heuristics for safety stock placement in general acyclic supply chain networks. 1333-1344
• 
  Hannan Sadjady, Hamid Davoudpour: Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs. 1345-1354
• 
  Kun He, Wenqi Huang, Yan Jin: An efficient deterministic heuristic for two-dimensional rectangular packing. 1355-1363
• 
  Deniz Aksen, Necati Aras: A bilevel fixed charge location model for facilities under imminent attack. 1364-1381
• 
  A. Cossari, Johnny C. Ho, Giuseppe Paletta, Alex J. Ruiz-Torres: A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria. 1382-1393
• 
  Kilhwan Kim: T-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks. 1394-1401
• 
  Joseph G. Szmerekovsky, Prahalad Venkateshan: An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs. 1402-1410
• 
  Subhash C. Sarin, Lixin Wang, Ming Cheng: A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times. 1411-1418
• 
  Yiyong Xiao, Qiuhong Zhao, Ikou Kaku, Yuchun Xu: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. 1419-1431
• 
  M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte: Synchronized arc routing for snow plowing operations. 1432-1440
• 
  Vladimir Marianov, Horst A. Eiselt: Transmitter location for maximum coverage and constructive-destructive interference management. 1441-1449
• 
  Shih-Hsin Chen, Pei-Chann Chang, T. C. E. Cheng, Qingfu Zhang: A Self-guided Genetic Algorithm for permutation flowshop scheduling problems. 1450-1457
• 
  Dar-Li Yang, T. C. E. Cheng, Suh-Jenq Yang, Chou-Jung Hsu: Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities. 1458-1464
• 
  S. M. H. Manzour-al-Ajdad, S. A. Torabi, K. Eshghi: Single-Source Capacitated Multi-Facility Weber Problem - An iterative two phase heuristic algorithm. 1465-1476
• 
  Leyla Demir, Semra Tunali, Deniz Türsel Eliiyi: An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines. 1477-1486
• 
  Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto: New constructive algorithms for leather nesting in the automotive industry. 1487-1505
• 
  Gokhan Kirlik, Ceyda Oguz: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. 1506-1520
• 
  Mark H. McElreath, Maria E. Mayorga: A dynamic programming approach to solving the assortment planning problem with multiple quality levels. 1521-1529
• 
  Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy: Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. 1530-1539
• 
  Lucie Galand, Olivier Spanjaard: Exact algorithms for OWA-optimization in multiobjective spanning tree problems. 1540-1554
• 
  Grigoris S. Piperagkas, I. Konstantaras, K. Skouri, Konstantinos E. Parsopoulos: Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics. 1555-1565
• 
  Alejandro Rodríguez, Rubén Ruiz: The effect of the asymmetry of road transportation networks on the traveling salesman problem. 1566-1576
• 
  Geraldo R. Mauri, Luiz Antonio Nogueira Lorena: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. 1577-1581
• 
  Fabien Tricoire, Alexandra Graf, Walter J. Gutjahr: The bi-objective stochastic covering tour problem. 1582-1592
• 
  Qinghua Wu, Jin-Kao Hao: An effective heuristic algorithm for sum coloring of graphs. 1593-1600
• 
  Gur Mosheiov, Daniel Oron: Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. 1601-1604
• 
  Abbas Ebadi, Ghasem Moslehi: Mathematical models for preemptive shop scheduling problems. 1605-1614
• 
  Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. 1615-1624
• 
  Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev: An aggregation heuristic for large scale p-median problem. 1625-1632
• 
  Elise Miller-Hooks, Xiaodong Zhang, Reza Faturechi: Measuring and maximizing resilience of freight transportation networks. 1633-1643
• 
  Der-Chiang Li, Peng-Hsiang Hsu: Solving a two-agent single-machine scheduling problem considering learning effect. 1644-1651
• 
  Mohammad Ranjbar, Morteza Davari, Roel Leus: Two branch-and-bound algorithms for the robust parallel machine scheduling problem. 1652-1660
• 
  Jason Chao-Hsien Pan, Ming-Hung Wu: Throughput analysis for order picking system with multiple pickers and aisle congestion considerations. 1661-1672
• 
  Mariano Luque, Kaisa Miettinen, Ana Belen Ruiz, Francisco Ruiz: A two-slope achievement scalarizing function for interactive multiobjective optimization. 1673-1681
• 
  Chung-Cheng Lu, Shih-Wei Lin, Kuo-Ching Ying: Robust scheduling on a single machine to minimize total flow time. 1682-1691
• 
  Lishun Zeng, Shinji Mizuno: On the separation in 2-period double round robin tournaments with minimum breaks. 1692-1700
• 
  Frank S. Yao, Mei Zhao, Hui Zhang: Two-stage hybrid flow shop scheduling with dynamic job arrivals. 1701-1712
• 
  Qiao Zhang, Hervé Manier, Marie-Ange Manier: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. 1713-1723
• 
  Pablo San Segundo: A new DSATUR-based algorithm for exact vertex coloring. 1724-1733
• 
  Kevin R. Gue, Hyun Ho Kim: Predicting departure times in multi-stage queueing systems. 1734-1744
• 
  Luis Fanjul-Peyro, Rubén Ruiz: Scheduling unrelated parallel machines with optional machines and jobs selection. 1745-1753
• 
  Dilip Datta, José Rui Figueira: Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers. 1754-1762
• 
  Xiaolin Huang, Jun Xu, Xiaomu Mu, Shuning Wang: The hill detouring method for minimizing hinging hyperplanes functions. 1763-1770
• 
  Hamid S. Mirmohammadi, Kourosh Eshghi: A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale. 1771-1778
• 
  Chunhua Men, H. Edwin Romeijn, Anneyuko Saito, James F. Dempsey: An efficient approach to incorporating interfraction motion in IMRT treatment planning. 1779-1789

Volume 39, Number 8, August 2012

• 
  Shoubo Xu, Zude Zhou, Pan Wang, John N. Warfield: Advances of operations research in service industry. 1791-1792
• 
  Edward C. Rosenthal, Sohail S. Chaudhry, In-Chan Choi, Jinbong Jang: On a class of branching problems in broadcasting and distribution. 1793-1799
• 
  Kyoung-jae Kim, Hyunchul Ahn: A corporate credit rating model using multi-class support vector machines with an ordinal pairwise partitioning approach. 1800-1811
• 
  Wangtu Xu, Shiwei He, Rui Song, Sohail S. Chaudhry: Finding the K shortest paths in a schedule-based transit network. 1812-1826
• 
  Karl D. Majeske, Thomas W. Lauer: Optimizing airline passenger prescreening systems with Bayesian decision models. 1827-1836
• 
  Hsiao-Fan Wang, Cheng-Ting Wu: A strategy-oriented operation module for recommender systems in E-commerce. 1837-1849
• 
  Zhili Zhou, Ling Li: Optimal cyclic single crane scheduling for two parallel train oilcan repairing lines. 1850-1856
• 
  Emili Tortosa-Ausina, Carmen Armero, David V. Conesa, Emili Grifell-Tatjé: Bootstrapping profit change: An application to Spanish banks. 1857-1871
• 
  Yu-Chung Tsao, Gwo-Ji Sheen: Effects of promotion cost sharing policy with the sales learning curve on supply chain coordination. 1872-1878
• 
  Fachao Li, Ling Li, Chenxia Jin, Ruijiang Wang, Hong Wang, Lili Yang: A 3PL supplier selection model based on fuzzy sets. 1879-1884
• 
  Chung-Tsen Tsao: Fuzzy net present values for capital investments in an uncertain environment. 1885-1892
• 
  Yi-Kuei Lin: Performance evaluation for a transportation system in stochastic case. 1901-1908

Volume 39, Number 9, September 2012

• 
  Inna G. Drobouchevitch, Jeffrey B. Sidney: Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs. 1919-1926
• 
  Enrique Gerstl, Gur Mosheiov: Scheduling job classes on uniform machines. 1927-1932
• 
  Rhyd Lewis, Jonathan M. Thompson, C. Mumford, J. Gillard: A wide-ranging computational comparison of high-performance graph colouring algorithms. 1933-1950
• 
  Arnaud Zinflou, Caroline Gagné, Marc Gravel: GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization. 1951-1968
• 
  Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer L. Pinto: Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. 1969-1976
• 
  Lixin Tang, Ping Che, Jiyin Liu: A stochastic production planning problem with nonlinear cost. 1977-1987
• 
  Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu: An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. 1988-2000
• 
  Seung Ho Yoo, DaeSoo Kim, Myung-Sub Park: Inventory models for imperfect production and inspection processes with various inspection options under one-time and continuous improvement investment. 2001-2015
• 
  K. Antony Arokia Durai Raj, Chandrasekharan Rajendran: A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem. 2016-2032
• 
  Jean-François Cordeau, Mirko Maischberger: A parallel iterated tabu search heuristic for vehicle routing problems. 2033-2050
• 
  Marcial Lapp, Amy Cohn: Modifying lines-of-flight in the planning process for improved maintenance robustness. 2051-2062
• 
  Pasquale Legato, Roberto Trunfio, Frank Meisel: Modeling and solving rich quay crane scheduling problems. 2063-2078
• 
  Kenneth Sörensen, Christine Vanovermeire, Sylvie Busschaert: Efficient metaheuristics to solve the intermodal terminal location problem. 2079-2090
• 
  Diogo Quintas, Vasilis Friderikos: Energy efficient spatial TDMA scheduling in wireless networks. 2091-2099
• 
  Lu Zhen: Analytical study on multi-product production planning with outsourcing. 2100-2110
• 
  Vincent C. Li, Yun-Chia Liang, Huan-Fu Chang: Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. 2111-2121
• 
  Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi: The min-conflict packing problem. 2122-2132
• 
  Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza: Variable neighborhood descent with iterated local search for routing and wavelength assignment. 2133-2141
• 
  Alejandro Rodríguez, Rubén Ruiz: A study on the effect of the asymmetry on real capacitated vehicle routing problems. 2142-2151
• 
  Guanlong Deng, Xingsheng Gu: A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. 2152-2160
• 
  Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte: The Traveling Salesman Problem with Draft Limits. 2161-2167
• 
  Wei-Chang Yeh: Simplified swarm optimization in disassembly sequencing problems with learning effects. 2168-2177
• 
  Wenbin Zhu, Hu Qin, Andrew Lim, Lei Wang: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. 2178-2195
• 
  Ju-Yong Lee, Yeong-Dae Kim: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. 2196-2205
• 
  Emilio Carrizosa, Milan Drazic, Zorica Drazic, Nenad Mladenovic: Gaussian variable neighborhood search for continuous optimization. 2206-2213
• 
  Itziar Landa-Torres, Javier Del Ser, Sancho Salcedo-Sanz, Sergio Gil-Lopez, José Antonio Portilla-Figueras, Oscar Alonso-Garrido: A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem. 2214-2222
• 
  Jorge M. S. Valente, Jeffrey E. Schaller: Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. 2223-2231
• 
  Patricio Hernández, Antonio Alonso-Ayuso, Fernanda Bravo, Laureano F. Escudero, Monique Guignard, Vladimir Marianov, Andres Weintraub: A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. 2232-2241
• 
  Heng-Soon Gan, Andrew Wirth, Amir H. Abdekhodaee: A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. 2242-2247
• 
  Andreas Bortfeldt: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. 2248-2257
• 
  Wojciech Bozejko: On single-walk parallelization of the job shop problem solving algorithms. 2258-2264
• 
  Sajid Siraj, Ludmil Mikhailov, John A. Keane: Corrigendum to "Enumerating all spanning trees for pairwise comparisons" [Computers & OR 39 (2012) 191-199]. 2265
• 
  Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez: An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. 2266

Volume 39, Number 10, October 2012

• 
  Defu Zhang, Yu Peng, Stephen C. H. Leung: A heuristic block-loading algorithm based on multi-layer search for the container loading problem. 2267-2276
• 
  Tao Zhang, W. A. Chaovalitwongse, Yuejie Zhang: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. 2277-2290
• 
  Qing-dao-er-ji Ren, Yuping Wang: A new hybrid genetic algorithm for job shop scheduling problem. 2291-2299
• 
  Lucio Grandinetti, Francesca Guerriero, Demetrio Laganà, Ornella Pisacane: An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem. 2300-2309
• 
  Ender Özcan, Andrew J. Parkes, Alpay Alkan: The Interleaved Constructive Memetic Algorithm and its application to timetabling. 2310-2322
• 
  Yasin Gocgun, Archis Ghate: Lagrangian relaxation and constraint generation for allocation and advanced scheduling. 2323-2336
• 
  Olga Battaïa, Alexandre Dolgui: Reduction approaches for a generalized line balancing problem. 2337-2345
• 
  Veronique Sels, Mario Vanhoucke: A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups. 2346-2358
• 
  Asvin Goel: The Canadian minimum duration truck driver scheduling problem. 2359-2367
• 
  Xiaobo Zhao, Minmin Qiu, Jinxing Xie, Qi-Ming He: Computing (r, Q) policy for an inventory system with limited sharable resource. 2368-2379
• 
  Gokhan Kirlik, Aydin Sipahioglu: Capacitated arc routing problem with deadheading demands. 2380-2394
• 
  Yaohua He, Yong Wu, Robert de Souza: A global search framework for practical three-dimensional packing with variable carton orientations. 2395-2414
• 
  Aymen Sioud, Marc Gravel, Caroline Gagné: A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. 2415-2424
• 
  M. Mesyagutov, Guntram Scheithauer, Gleb Belov: LP bounds in various constraint programming approaches for orthogonal packing. 2425-2438
• 
  Yuan Qu, Jonathan F. Bard: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. 2439-2456

Volume 39, Number 11, November 2012

• 
  Mi-Yi Kim, Young Hoon Lee: MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. 2457-2468
• 
  Vidar Gunnerud, Bjarne Foss, K. I. M. McKinnon, B. Nygreen: Oil production optimization solved by piecewise linearization in a Branch & Price framework. 2469-2477
• 
  Celik Parkan, Jiamin Wang, Desheng Wu, Guiwu Wei: Data envelopment analysis based on maximin relative efficiency criterion. 2478-2487
• 
  Tal Avinadav, David Sarne: Sequencing counts: A combined approach for sequencing and selecting costly unreliable off-line inspections. 2488-2499
• 
  Milosz Kadzinski, Salvatore Greco, Roman Slowinski: Selection of a representative set of parameters for robust ordinal regression outranking methods. 2500-2519
• 
  Wajdi Trabelsi, Christophe Sauvey, Nathalie Sauer: Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems. 2520-2527
• 
  Raquel J. Fonseca, Berç Rustem: Robust hedging strategies. 2528-2536
• 
  Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte: The inventory-routing problem with transshipment. 2537-2548
• 
  Sebastian Henn: Algorithms for on-line order batching in an order picking warehouse. 2549-2563
• 
  Mojtaba Shakeri, Malcolm Yoke-Hean Low, Stephen John Turner, Eng Wah Lee: A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock. 2564-2577
• 
  Gabrio Caimi, Martin Fuchsberger, Marco Laumanns, Marco Lüthi: A model predictive control approach for discrete-time rescheduling in complex central railway station areas. 2578-2593
• 
  Majid Salari, Zahra Naji Azimi: An integer programming-based local search for the covering salesman problem. 2594-2602
• 
  Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard: A Tabu search algorithm for the network pricing problem. 2603-2611
• 
  Esra Koca, E. Alper Yildirim: A hierarchical solution approach for a multicommodity distribution problem under a special cost structure. 2612-2624
• 
  Emilio Carrizosa, Anton Ushakov, Igor Vasilyev: A computational study of a nonlinear minsum facility location problem. 2625-2633
• 
  Cenk Çaliskan: A faster polynomial algorithm for the constrained maximum flow problem. 2634-2641
• 
  Reza Kia, Armand Baboli, Nikbakhsh Javadian, Reza Tavakkoli-Moghaddam, Mohammad Kazemi, Javad Khorrami: Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing. 2642-2658
• 
  Pawel Jan Kalczynski, Jerzy Kamburowski: An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. 2659-2665
• 
  Frédéric Meunier, Bertrand Neveu: Computing solutions of the paintshop-necklace problem. 2666-2678
• 
  Klemens Katterbauer, Ceyda Oguz, F. Sibel Salman: Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem. 2679-2687
• 
  Tsung-Jung Hsieh, Wei-Chang Yeh: Penalty guided bees search for redundancy allocation problems with a mix of components in series-parallel systems. 2688-2704
• 
  Maciej Drozdowski, D. Kowalski, J. Mizgajski, D. Mokwa, Grzegorz Pawlak: Mind the gap: A study of Tube tour. 2705-2714
• 
  Davide Anghinolfi, Giorgio Cannata, Fulvio Mastrogiovanni, Cristiano Nattero, Massimo Paolucci: Heuristic approaches for the optimal wiring in large scale robotic skin design. 2715-2724
• 
  Hande Yaman, Sourour Elloumi: Star p-hub center problem and star p-hub median problem with bounded path lengths. 2725-2732
• 
  Dieter Claeys, Bart Steyaert, Joris Walraevens, Koenraad Laevens, Herwig Bruneel: Tail distribution of the delay in a general batch-service queueing model. 2733-2741
• 
  Cenk Çaliskan: A computational study of the capacity scaling algorithm for the maximum flow problem. 2742-2747
• 
  Réal André Carbonneau, Gilles Caporossi, Pierre Hansen: Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression. 2748-2762
• 
  Mario Ventresca: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. 2763-2775
• 
  Rafael A. Melo, Laurence A. Wolsey: MIP formulations and heuristics for two-level production-transportation problems. 2776-2786
• 
  Frank Mufalli, Rajan Batta, Rakesh Nagi: Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans. 2787-2799
• 
  Prince Bedell, J. MacGregor Smith: Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems. 2800-2819
• 
  Tsung-Che Chiang, Li-Chen Fu: Rule-based scheduling in wafer fabrication with due date-based objectives. 2820-2835
• 
  Gianluca Aloi, R. Musmanno, Pasquale Pace, O. Pisacane: A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks. 2836-2847
• 
  Jørgen Bang-Jensen, Rune Larsen: Efficient algorithms for real-life instances of the variable size bin packing problem. 2848-2857
• 
  Stephen E. Wright: New linearizations of quadratic assignment problems. 2858-2866
• 
  Rafay Ishfaq: LTL logistics networks with differentiated services. 2867-2879
• 
  Cheng Wang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan. 2880-2887
• 
  Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Efficient determination of the k most vital edges for the minimum spanning tree problem. 2888-2898
• 
  Inmaculada Espejo, Antonio M. Rodríguez-Chía: Corrigendum to "Simultaneous location of a service facility and a rapid transit line" [Computers & Operations Research 38(2) (2011) 525-538]. 2899-2903

Volume 39, Number 12, December 2012

• 
  Bart Feyaerts, Stijn De Vuyst, Herwig Bruneel, Sabine Wittevrongel: Analysis of discrete-time buffers with heterogeneous session-based arrivals and general session lengths. 2905-2914
• 
  Zhiqiang Lu, Xiaole Han, Lifeng Xi, Alan L. Erera: A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. 2915-2928
• 
  Kerstin Dächert, Jochen Gorski, Kathrin Klamroth: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. 2929-2943
• 
  Christophe Duhamel, Andréa Cynthia Santos, Lucas Moreira Guedes: Models and hybrid methods for the onshore wells maintenance problem. 2944-2953
• 
  Dominik Kress, Erwin Pesch: (r|p)-centroid problems on networks with vertex and edge demand. 2954-2967
• 
  Joaquim A. S. Gromicho, Jelke J. van Hoorn, Francisco Saldanha-da-Gama, Gerrit T. Timmer: Solving the job-shop scheduling problem optimally by dynamic programming. 2968-2977
• 
  K. Kianfar, G. Moslehi: A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. 2978-2990
• 
  Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi: An exact strip packing algorithm based on canonical forms. 2991-3011
• 
  Mostafa K. Ardakani, Lu Sun: Decremental algorithm for adaptive routing incorporating traveler information. 3012-3020
• 
  Esa Hyytiä, Aleksi Penttinen, Reijo Sulonen: Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. 3021-3030
• 
  Yaodong Cui, Baixiong Huang: Heuristic for constrained T-shape cutting patterns of rectangular pieces. 3031-3039
• 
  Oualid Jouini: Analysis of a last come first served queueing system with customer abandonment. 3040-3045
• 
  Harun Pirim, Burak Eksioglu, Andy D. Perkins, Çetin Yüceer: Clustering of high throughput gene expression data. 3046-3061
• 
  Yunqiang Yin, Wen-Hsiang Wu, Shuenn-Ren Cheng, Chin-Chia Wu: An investigation on a two-agent single-machine scheduling problem with unequal release dates. 3062-3073
• 
  Aldy Gunawan, Kien Ming Ng, Kim-Leng Poh: A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem. 3074-3088
• 
  Fabien Tricoire: Multi-directional local search. 3089-3101
• 
  Ahmad I. Jarrah, Jonathan F. Bard: Large-scale pickup and delivery work area design. 3102-3118
• 
  Linzhong Liu, Haibo Mu, Haiyan Luo, Xiaojing Li: A simulated annealing for multi-criteria network path problems. 3119-3135
• 
  Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo: A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon. 3136-3146
• 
  Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev: Algorithms and implementation of a set partitioning approach for modular machining line design. 3147-3155
• 
  Mustafa S. Canbolat, George O. Wesolowsky: A planar single facility location and border crossing problem. 3156-3165
• 
  André Rossi, Alok Singh, Marc Sevaux: An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges. 3166-3176
• 
  Ryan C. Loxton, Qun Lin, Kok Lay Teo: A stochastic fleet composition problem. 3177-3184
• 
  Claudio Contardo, Vera C. Hemmelmayr, Teodor Gabriel Crainic: Lower and upper bounds for the two-echelon capacitated location-routing problem. 3185-3199
• 
  Peter Brucker, Edmund K. Burke, Sven Groenemeyer: A branch and bound algorithm for the cyclic job-shop problem with transportation. 3200-3214
• 
  Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic: An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. 3215-3228
• 
  Yifan Wu, Ming Dong, Tijun Fan, Shaoxuan Liu: Performance evaluation of supply chain networks with assembly structure under system disruptions. 3229-3243
• 
  Vincent T'Kindt, Federico Della Croce: A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment. 3244-3246
• 
  Abraham Duarte, Laureano F. Escudero, Rafael Martí, Nenad Mladenovic, Juan José Pantrigo, Jesús Sánchez-Oro: Variable neighborhood search for the Vertex Separation Problem. 3247-3255
• 
  David F. Muñoz, Diego F. Muñoz: Algorithms for the generalized weighted frequency assignment problem. 3256-3266
• 
  Hon-Shiang Lau, Chang Su, Yao-Yu Wang, Zhong-Sheng Hua: Volume discounting coordinates a supply chain effectively when demand is sensitive to both price and sales effort. 3267-3280
• 
  Jigang Wu, Qiqiang Sun, Thambipillai Srikanthan: Algorithmic aspects for multiple-choice hardware/software partitioning. 3281-3292
• 
  Ilhem Boussaïd, Amitava Chatterjee, Patrick Siarry, Mohamed Ahmed-Nacer: Biogeography-based optimization for constrained optimization problems. 3293-3304
• 
  Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers: A branch-price-and-cut algorithm for the workover rig routing problem. 3305-3315
• 
  Wei Weng, Xin Wei, Shigeru Fujimura: Dynamic routing strategies for JIT production in hybrid flow shops. 3316-3324
• 
  André R. S. Amaral: The corridor allocation problem. 3325-3330
• 
  Fang He, Rong Qu: A constraint programming based column generation approach to nurse rostering problems. 3331-3343
• 
  Talip Kellegöz, Bilal Toklu: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations. 3344-3360
• 
  Magnus Stålhane, Henrik Andersson, Marielle Christiansen, Jean-François Cordeau, Guy Desaulniers: A branch-price-and-cut method for a ship routing and scheduling problem with split loads. 3361-3375
• 
  Zhiqiao Wu, C. K. Kwong, Jiafu Tang, J. W. K. Chan: Integrated model for software component selection with simultaneous consideration of implementation and verification. 3376-3393
• 
  Jussara Rodrigues Ciappina, Akebo Yamakami, Ricardo C. Silva: Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems. 3394-3407
• 
  Yaxian Li, George L. Nemhauser, Martin W. P. Savelsbergh: Pricing for production and delivery flexibility in single-item lot-sizing. 3408-3419
• 
  Jean Berger, Abdeslem Boukhtouta, Abdelhamid Benmoussa, Ossama Kettani: A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment. 3420-3430
• 
  José Niño-Mora: Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies. 3431-3444

last updated on Sat May 25 03:47:35 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page