Computers & Operations Research, Volume 35

Volume 35, Number 1, January 2008

Part Special Issue: Applications of OR in Finance

• 
  Michèle Breton:
  Special Issue of Computers & Operations Research Applications of OR in Finance. 1-2
• 
  Dimitris Bertsimas, Dessislava Pachamanova:
  Robust multiperiod portfolio management in the presence of transaction costs. 3-17
• 
  Michael J. Best, Jaroslava Hlouskova:
  Quadratic programming with transaction costs. 18-33
• 
  Lean Yu, Shouyang Wang, Kin Keung Lai:
  Neural network-based mean-variance-skewness model for portfolio selection. 34-46
• 
  Ricardo Josa-Fombellida, Juan Pablo Rincón-Zapatero:
  Funding and investment decisions in a stochastic defined benefit pension plan with several levels of labor-income earnings. 47-63
• 
  Javier de Frutos:
  A spectral method for bonds. 64-75
• 
  Xun Li, Zhenyu Wu:
  On an approximation method for pricing a high-dimensional basket option on assets with mean-reverting prices. 76-89
• 
  Eymen Errais, Jeffrey Sadowsky:
  Valuing pilot projects in a learning by investing framework: An approximate dynamic programming approach. 90-112
• 
  Gonzalo Cortazar, Miguel Gravet, Jorge Urzúa:
  The valuation of multidimensional American real options using the LSM simulation method. 113-129
• 
  Pierre Duchesne, Maria Pacurar:
  Evaluating financial time series models for irregularly spaced data: A spectral density approach. 130-155
• 
  Rosangela Helena Loschi, Frederico R. B. Cruz, Ricardo H. C. Takahashi, Pilar Loreto Iglesias, Reinaldo Boris Arellano-Valle, James MacGregor Smith:
  A note on Bayesian identification of change points in data sequences. 156-170
• 
  Mohamed A. Ayadi, Lawrence Kryzanowski:
  Portfolio performance sensitivity for various asset-pricing kernels. 171-185

Normal Papers

• 
  Maria João Alves, João C. N. Clímaco, Carlos Henggeler Antunes, Humberto Jorge, Antonio Gomes Martins:
  Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management. 186-197
• 
  Sarah Steiner, Tomasz Radzik:
  Computing all efficient solutions of the biobjective minimum spanning tree problem. 198-211
• 
  Yaodong Cui:
  Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns. 212-225
• 
  Mercedes Esteban-Bravo, Francisco J. Nogales:
  Solving dynamic stochastic economic models by mathematical programming decomposition methods. 226-240
• 
  Marco Caserta, E. Quiñonez Rico, A. Márquez Uribe:
  A cross entropy algorithm for the Knapsack problem with setups. 241-252
• 
  Andrew J. Higgins, Stefan Hajkowicz, Elisabeth N. Bui:
  A multi-objective model for environmental investment decision making. 253-266
• 
  Julia A. Bennell, Xiang Song:
  A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. 267-281
• 
  Chaoyong Zhang, Peigen Li, Yunqing Rao, Zailin Guan:
  A very fast TS/SA algorithm for the job shop scheduling problem. 282-294
• 
  Tarik Belgacem, Mhand Hifi:
  Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item. 295-308

Volume 35, Number 2, February 2008

Part Special Issue: Location Modeling Dedicated to the memory of Charles S. ReVelle

• 
  Horst A. Eiselt, Samuel Ratick:
  Introduction. 309-311
• 
  Barbara Pfeiffer, Kathrin Klamroth:
  A unified model for Weber problems with continuous and network distances. 312-326
• 
  Lixun Zhang, Gerard Rushton:
  Optimizing the size and locations of facilities in competitive multi-site service systems. 327-338
• 
  Alan T. Murray, Morton E. O'Kelly, Richard L. Church:
  Regional service coverage modeling. 339-355
• 
  Oded Berman, Rongbing Huang:
  The minimum weighted covering location problem with distance constraints. 356-372
• 
  Yolanda Hinojosa, Jörg Kalcsics, Stefan Nickel, Justo Puerto, Sebastian Velten:
  Dynamic supply chain design with inventory. 373-391
• 
  Oded Berman, Qian Wang:
  Locating a semi-obnoxious facility with expropriation. 392-403
• 
  Enrique Domínguez, José Muñoz:
  A neural model for the p-median problem. 404-416
• 
  Richard L. Church:
  BEAMR: An exact and approximate model for the p-median problem. 417-426
• 
  Charles S. Revelle, Michelle Scholssberg, Justin C. Williams:
  Solving the maximal covering location problem with heuristic concentration. 427-435
• 
  Giuseppe Bruno, Gennaro Improta:
  Using gravity models for the evaluation of new university site locations: A case study. 436-444
• 
  Bilal Farhan, Alan T. Murray:
  Siting park-and-ride facilities using a multi-objective spatial optimization model. 445-456
• 
  Ronald K. Klimberg, Samuel J. Ratick:
  Modeling data envelopment analysis (DEA) efficient location/allocation decisions. 457-474
• 
  Vladimir Marianov, Charles S. Revelle, Stephanie A. Snyder:
  Selecting compact habitat reserves for species with differential habitat size needs. 475-487
• 
  Justin C. Williams:
  Optimal reserve site selection with distance requirements. 488-498
• 
  Rex K. Kincaid, Catherine Easterling, Meagan Jeske:
  Computational experiments with heuristics for two nature reserve site selection problems. 499-512
• 
  Horst A. Eiselt, Vladimir Marianov:
  Employee positioning and workload allocation. 513-524

Normal papers

• 
  Alix Munier Kordon, Djamal Rebaine:
  Polynomial time algorithms for the UET permutation flowshop problem with time delays. 525-537
• 
  Marc Peeters, Leo G. Kroon:
  Circulation of railway rolling stock: a branch-and-price approach. 538-556
• 
  Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari:
  Max-min fairness in multi-commodity flows. 557-573
• 
  Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. 574-599
• 
  Luis Gouveia, Ana Paias, Dushyant Sharma:
  Modeling and solving the rooted distance-constrained minimum spanning tree problem. 600-613
• 
  Satyaveer Singh Chauhan, Alain Martel, Sophie D'Amours:
  Roll assortment optimization in a paper mill: An integer programming approach. 614-627
• 
  Boris Bontoux, Dominique Feillet:
  Ant colony optimization for the traveling purchaser problem. 628-637
• 
  Adam N. Letchford, Nicholas A. Pearson:
  Good triangulations yield good tours. 638-647

Volume 35, Number 3, March 2008

Part Special Issue: New Trends in Locational Analysis

• 
  S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick Ndiaye, Stefan Nickel, Blas Pelegrín:
  New trends in locational analysis. 649-650
• 
  Maria Cruz López de los Mozos Martin, Juan A. Mesa, Justo Puerto:
  A generalized model of equality measures in network location problems. 651-660
• 
  Éric Gourdin, Olivier Klopfenstein:
  Multi-period capacitated location with modular equipments. 661-682
• 
  Frank Plastria, Lieselot Vanhaverbeke:
  Discrete models for competitive location with foresight. 683-700
• 
  T. Brian Boffey, Juan A. Mesa, Francisco A. Ortega, José I. Rodrigues:
  Locating a low-level waste disposal site. 701-716
• 
  Zvi Drezner:
  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. 717-736
• 
  Blas Pelegrín, José Fernández, Boglárka Tóth:
  The 1-center problem in the plane with independent random weights. 737-749
• 
  Justo Puerto, Antonio M. Rodríguez-Chía:
  Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets. 750-765
• 
  Stefano Benati:
  Categorical data fuzzy clustering: An analysis of local search heuristics. 766-775

Normal Papers

• 
  Ye Chen, Kevin W. Li, D. Marc Kilgour, Keith W. Hipel:
  A case-based distance model for multiple criteria ABC analysis. 776-796
• 
  José Luis González Velarde, Rafael Martí:
  Adaptive memory programing for the robust capacitated international sourcing problem. 797-806
• 
  Mark W. Lewis, Gary A. Kochenberger, Bahram Alidaee:
  A new modeling and solution approach for the set-partitioning problem. 807-813
• 
  Hari K. Rajagopalan, Cem Saydam, Jing Xiao:
  A multiperiod set covering location model for dynamic redeployment of ambulances. 814-826
• 
  Imed Kacem, Chengbin Chu, Ahmed Souissi:
  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. 827-844
• 
  Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su:
  A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. 845-853
• 
  Roberto Cordone, Federico Gandellini, Giovanni Righini:
  Solving the swath segment selection problem through Lagrangean relaxation. 854-862
• 
  Sang-Oh Shim, Yeong-Dae Kim:
  A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. 863-875
• 
  Dar-Li Yang, Chou-Jung Hsu, Wen-Hung Kuo:
  A two-machine flowshop scheduling problem with a separated maintenance constraint. 876-883
• 
  Yong-Gon Cho, Keun-Tae Cho:
  A loss function approach to group preference aggregation in the AHP. 884-892
• 
  Alexandre Dolgui, Maxim Pashkevich:
  On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items. 893-905
• 
  Philippe Baptiste, Marta Flamini, Francis Sourd:
  Lagrangian bounds for just-in-time job-shop scheduling. 906-915
• 
  Silvio A. de Araujo, Marcos N. Arenales, Alistair R. Clark:
  Lot sizing and furnace scheduling in small foundries. 916-932
• 
  Deniz Türsel Eliiyi, Melih Özlen:
  A Lagrangean relaxation approach for the mixed-model flow line sequencing problem. 933-943
• 
  François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim:
  A new constraint programming approach for the orthogonal packing problem. 944-959
• 
  Ivo Blöchliger, Nicolas Zufferey:
  A graph coloring heuristic using partial solutions and a reactive tabu scheme. 960-975
• 
  Reakook Hwang, Mitsuo Gen, Hiroshi Katayama:
  A comparison of multiprocessor task scheduling algorithms with communication costs. 976-993
• 
  Peter Zörnig:
  A note on cycling LP examples with permutation structure. 994-1002

Volume 35, Number 4, April 2008

• 
  E. Jack Chen, W. David Kelton:
  Estimating steady-state distributions via simulation-generated histograms. 1003-1016
• 
  Mahesh Kumar, James B. Orlin:
  Scale-invariant clustering with minimum volume ellipsoids. 1017-1029
• 
  Kuo-Ling Huang, Ching-Jong Liao:
  Ant colony optimization combined with taboo search for the job shop scheduling problem. 1030-1046
• 
  Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Henrique Pacca Loureiro Luna:
  Benders decomposition for the uncapacitated multiple allocation hub location problem. 1047-1064
• 
  Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
  Reactive GRASP for the strip-packing problem. 1065-1083
• 
  Ali Husseinzadeh Kashan, Behrooz Karimi, Masoud Jenabi:
  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. 1084-1098
• 
  Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi:
  A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. 1099-1111
• 
  José Brandão, Richard W. Eglese:
  A deterministic tabu search algorithm for the capacitated arc routing problem. 1112-1126
• 
  Emmanuel Néron, Fabrice Tercinet, Francis Sourd:
  Search tree based approaches for parallel machine scheduling. 1127-1137
• 
  Cenk Çaliskan:
  A double scaling algorithm for the constrained maximum flow problem. 1138-1150
• 
  Rubén Ruiz, Funda Sivrikaya-Serifoglu, Thijs Urlings:
  Modeling realistic hybrid flexible flowshop scheduling problems. 1151-1175
• 
  Rabia Nessah, Farouk Yalaoui, Chengbin Chu:
  A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. 1176-1190
• 
  José H. Dulá:
  A computational study of DEA with massive data sets. 1191-1203
• 
  Têkogan D. Hemazro, Brigitte Jaumard, Odile Marcotte:
  A column generation and branch-and-cut algorithm for the channel assignment problem. 1204-1226
• 
  Alex J. Ruiz-Torres, Grisselle Centeno:
  Minimizing the number of late jobs for the permutation flowshop problem with secondary resources. 1227-1249
• 
  Pedro Leite Rocha, Martín Gómez Ravetti, Geraldo Robson Mateus, Panos M. Pardalos:
  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. 1250-1264
• 
  Grigorios N. Beligiannis, Charalampos N. Moschopoulos, Georgios P. Kaperonis, Spiridon D. Likothanassis:
  Applying evolutionary computation to the school timetabling problem: The Greek case. 1265-1280
• 
  Yaodong Cui, Yuli Yang, Xian Cheng, Peihua Song:
  A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. 1281-1291
• 
  Patrick N. Bless, Diego Klabjan, Soo Y. Chang:
  Heuristics for automated knowledge source integration and service composition. 1292-1314
• 
  Cláudio Alves, José M. Valério de Carvalho:
  A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. 1315-1328
• 
  Andreas C. Nearchou:
  A differential evolution approach for the common due date early/tardy job scheduling problem. 1329-1343
• 
  Dehua Xu, Kaibiao Sun, Hongxing Li:
  Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. 1344-1349
• 
  Eva Vallada, Rubén Ruiz, Gerardo Minella:
  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. 1350-1373
• 
  Bernardo Almada-Lobo, José Fernando Oliveira, Maria Antónia Carravilla:
  A note on "the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. 1374-1376

Volume 35, Number 5, May 2008

Part Special Issue: Algorithms and Computational Methods in Feasibility and Infeasibility

• 
  John W. Chinneck:
  Editorial. 1377-1378
• 
  Leon S. Lasdon, John C. Plummer:
  Multistart algorithms for seeking feasibility. 1379-1393
• 
  Walid Ibrahim, John W. Chinneck:
  Improving solver success in reaching feasibility for sets of nonlinear constraints. 1394-1411
• 
  Chandra Sekhar Pedamallu, Linet Özdamar, Martine Ceberio:
  Efficient interval partitioning - Local search collaboration for constraint satisfaction. 1412-1435
• 
  Matteo Fischetti, Andrea Lodi:
  Repairing MIP infeasibility through local branching. 1436-1445
• 
  Mustafa K. Atlihan, Linus Schrage:
  Generalized filtering algorithms for infeasibility analysis. 1446-1464
• 
  Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale:
  A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. 1465-1482
• 
  Jian Yang:
  Infeasibility resolution based on goal programming. 1483-1493
• 
  Paula Amaral, Joaquim Júdice, Hanif D. Sherali:
  A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints. 1494-1509
• 
  Yu Xia, Farid Alizadeh:
  The Q method for second order cone programming. 1510-1538

Normal papers

• 
  Dvir Shabtay:
  Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. 1539-1545
• 
  Ardavan Asef-Vaziri, Nicholas G. Hall, Ronny George:
  The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path. 1546-1561
• 
  Marta Mesquita, Ana Paias:
  Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. 1562-1575
• 
  Robert A. Russell, Wen-Chyuan Chiang, David Zepeda:
  Integrating multi-product production and distribution in newspaper logistics. 1576-1588
• 
  Paolo Dell'Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola:
  Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. 1589-1600
• 
  Artyom G. Nahapetyan, Panos M. Pardalos:
  A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems. 1601-1612
• 
  Maria Teresa Almeida, Gabriela Schütz, Filipa Duarte de Carvalho:
  Cell suppression problem: A genetic-based approach. 1613-1623
• 
  Fuh-Hwa Franklin Liu, Hao Hsuan Peng:
  Ranking of units on the DEA frontier with common weights. 1624-1637
• 
  Juan José Salazar González:
  Statistical confidentiality: Optimization techniques to protect tables. 1638-1651
• 
  Chin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee:
  Single-machine group scheduling problems with deterioration consideration. 1652-1659
• 
  Byeong Seok Ahn, Kyung Sam Park:
  Comparing methods for multiattribute decision making with ordinal weights. 1660-1670
• 
  X. Q. Cai, J. Chen, Y. B. Xiao, X. L. Xu:
  Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline. 1671-1683
• 
  Seong-Woo Choi, Yeong-Dae Kim:
  Minimizing makespan on an m-machine re-entrant flowshop. 1684-1696
• 
  Yasmin A. Rios-Solis, Francis Sourd:
  Exponential neighborhood search for a parallel machine scheduling problem. 1697-1712
• 
  Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib Metrane, François Soumis:
  Bi-dynamic constraint aggregation and subproblem reduction. 1713-1724
• 
  Abdellah El-Fallahi, Christian Prins, Roberto Wolfler Calvo:
  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. 1725-1741
• 
  Zhipeng Lü, Wenqi Huang:
  PERM for solving circle packing problem. 1742-1755

Volume 35, Number 6, June 2008

Part Special Issue: OR Applications in the Military and in Counter-Terrorism

• 
  Rajan Batta:
  Foreword. 1757-1758
• 
  Orhan Karasakal:
  Air defense missile-target allocation models for a naval task group. 1759-1770
• 
  Corbin G. Koepke, Andrew P. Armacost, Cynthia Barnhart, Stephan E. Kolitz:
  An integer programming approach to support the US Air Force's air mobility network. 1771-1788
• 
  Trevor I. Laine, Kenneth W. Bauer Jr.:
  A mathematical framework to optimize ATR systems with non-declarations and sensor fusion. 1789-1812
• 
  Vijay K. Shetty, Moises Sudit, Rakesh Nagi:
  Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles. 1813-1828
• 
  R. A. Hahn, Alexandra M. Newman:
  Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida. 1829-1843
• 
  John F. Raffensperger, Linus Schrage:
  Scheduling training for a tank battalion: How to measure readiness. 1844-1864
• 
  Richard K. Bullock, Richard F. Deckro, Jeffery D. Weir:
  Methodology for competitive strategy development. 1865-1873
• 
  Jonathan P. Caulkins, Dieter Grass, Gustav Feichtinger, Gernot Tragler:
  Optimizing counter-terror operations: Should one fight fire with "fire" or "water"? 1874-1885
• 
  Yupo Chan, Jean M. Mahan, James W. Chrissis, David A. Drake, Dong Wang:
  Hierarchical maximal-coverage location-allocation: Case of generalized search-and-rescue. 1886-1904
• 
  Maria Paola Scaparra, Richard L. Church:
  A bilevel mixed-integer program for critical infrastructure protection planning. 1905-1923
• 
  Pavel Albores, Duncan Shaw:
  Government preparedness: Using simulation to prepare for a terrorist attack. 1924-1943
• 
  Guillermo Owen, Gordon H. McCormick:
  Finding a moving fugitive. A game theoretic representation of search. 1944-1962

Normal papers

•