European Journal of Operational Research, Volume 206

Volume 206, Number 1, October 2010

• Stephan Meisel, Dirk C. Mattfeld:
  Synergies of Operations Research and Data Mining. 1-10
  

• Rainer E. Burkard, Mohammadreza Galavii, Elisabeth Gassner:
  The inverse Fermat-Weber problem. 11-17
  
• Vyacheslav Kalashnikov, Gerardo A. Pérez-Valdés, Asgeir Tomasgard, Nataliya Kalashnykova:
  Natural gas cash-out problem: Bilevel stochastic optimization approach. 18-33
  
• Chungen Shen, Wenjuan Xue, Xiongda Chen:
  Global convergence of a robust filter SQP algorithm. 34-45
  

• Edmund K. Burke, A. J. Eckersley, Barry McCollum, Sanja Petrovic, Rong Qu:
  Hybrid variable neighbourhood approaches to university exam timetabling. 46-53
  
• Artur Alves Pessoa, Peter M. Hahn, Monique Guignard, Yi-Rong Zhu:
  Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. 54-63
  
• Chuyang Wang, Xiaoping Li, Qian Wang:
  Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. 64-72
  

• Jonathan F. Bard, Ahmad I. Jarrah, Jing Zan:
  Validating vehicle routing zone construction using Monte Carlo simulation. 73-85
  
• Chunming Victor Shi, Xuan Zhao, Yu Xia:
  The setting of profit targets for target oriented divisions. 86-92
  
• Luc Muyldermans, Gu Pang:
  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. 93-103
  

• Ulrich Faigle, Michel Grabisch, M. Heyne:
  Monge extensions of cooperation and communication structures. 104-110
  
• Ji Hwan Cha, Maxim Finkelstein:
  Burn-in by environmental shocks for two ordered subpopulations. 111-117
  
• Hyunmin Park, Tae-Sung Kim, Kyung C. Chae:
  Analysis of a two-phase queueing system with a fixed-size batch policy. 118-122
  

• Kyoko Yagi, Katsushige Sawaki:
  The pricing and optimal strategies of callable warrants. 123-130
  
• Yanjun Qian, Min Xie, Thong Ngee Goh, Jun Lin:
  Optimal testing strategies in overlapped design process. 131-143
  
• Dmitry Krass, Anton Ovchinnikov:
  Constrained group balancing: Why does it work. 144-154
  

• Broos Maenhout, Mario Vanhoucke:
  A hybrid scatter search heuristic for personalized crew rostering in the airline industry. 155-167
  
• Dong-Guen Kim, Yeong-Dae Kim:
  A branch and bound algorithm for determining locations of long-term care facilities. 168-177
  
• Xiaojun Shi, Shunming Zhang:
  An incentive-compatible solution for trade credit term incorporating default risk. 178-196
  
• Juan-Carlos Ferrer, Hugo Mora, Francisco Olivares:
  On pricing of multiple bundles of products and services. 197-208
  
• P. N. Kodikara, B. J. C. Perera, M. D. U. P. Kularathna:
  Stakeholder preference elicitation and modelling in multi-criteria decision analysis - A case study on urban water supply. 209-220
  
• Yuanjie He, Jiang Zhang:
  Random yield supply chain with a yield dependent secondary market. 221-230
  

• Rajiv D. Banker, Zhiqiang (Eric) Zheng, Ram Natarajan:
  DEA-based hypothesis tests for comparing two groups of decision making units. 231-238
  
• Harald Hruschka:
  Considering endogeneity for optimal catalog allocation in direct marketing. 239-247
  
• Stefan Schneider, Pasha Shabalin, Martin Bichler:
  On the robustness of non-linear personalized price combinatorial auctions. 248-259
  

• Cornelia Schön:
  On the product line selection problem under attraction choice models of consumer behavior. 260-264
  
• Ali Emrouznejad, Gholam R. Amin, Emmanuel Thanassoulis, Abdel Latef Anouze:
  On the boundedness of the SORM DEA models with negative data. 265-268
  
• Jens J. Krüger:
  Comment on "A new clustering approach using data envelopment analysis". 269-270
  

Volume 206, Number 2, October 2010

• Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
  Satisfactory graph partition, variants, and generalizations. 271-280
  

• Ali Khanafer, François Clautiaux, El-Ghazali Talbi:
  New lower bounds for bin packing problems with conflicts. 281-288
  
• Aleksandar Ilic, Dragan Urosevic, Jack Brimberg, Nenad Mladenovic:
  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. 289-300
  
• Yaron Leyvand, Dvir Shabtay, George Steiner:
  A unified approach for scheduling with convex resource consumption functions using positional penalties. 301-312
  

• Amanda J. Schmitt, Lawrence V. Snyder, Zuo-Jun Max Shen:
  Inventory systems with stochastic demand and supply: Properties and approximations. 313-328
  
• Fouad El Ouardighi, Bowon Kim:
  Supply quality management with wholesale price and revenue-sharing contracts under horizontal competition. 329-340
  
• Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov:
  A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. 341-349
  
• Guoqing Zhang:
  The multi-product newsboy problem with supplier quantity discounts and a budget constraint. 350-360
  
• Yugang Yu, George Q. Huang:
  Nash game model for optimizing market strategies, configuration of platform products in a Vendor Managed Inventory (VMI) supply chain for a product family. 361-373
  
• He Xu, Ning Shi, Shi-hua Ma, Kin Keung Lai:
  Contracting with an urgent supplier under cost information asymmetry. 374-383
  

• Philip A. Scarf, Cristiano A. V. Cavalcante:
  Hybrid block replacement and inspection policies for a multi-component system with heterogeneous component lives. 384-394
  
• Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefer:
  Adaptive multicut aggregation for two-stage stochastic linear programs with recourse. 395-406
  
• Zydrunas Vagnorius, Marvin Rausand, Knut Sørby:
  Determining optimal replacement time for metal cutting tools. 407-416
  

• John W. Fowler, Esma Senturk Gel, Murat Köksalan, Pekka J. Korhonen, Jon L. Marquis, Jyrki Wallenius:
  Interactive evolutionary multi-objective optimization for quasi-concave preference functions. 417-425
  
• Kaisa Miettinen, Petri Eskelinen, Francisco Ruiz, Mariano Luque:
  NAUTILUS method: An interactive technique in multiobjective optimization based on the nadir point. 426-434
  
• Géraldine Bous, Philippe Fortemps, François Glineur, Marc Pirlot:
  ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements. 435-444
  

• Pawan Lingras, Cory J. Butz:
  Rough support vector regression. 445-455
  
• Panayotis Michaelides, Angelos Vouldis, Efthymios G. Tsionas:
  Globally flexible functional forms: The neural distance function. 456-469
  
• Michelle Dunbar, John M. Murray, Lucette A. Cysique, Bruce J. Brew, Vaithilingam Jeyakumar:
  Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment. 470-478
  

• Sergey Samoilenko, Kweku-Muata Osei-Bryson:
  Determining sources of relative inefficiency in heterogeneous samples: Methodology using Cluster Analysis, DEA and Neural Networks. 479-487
  
• Frederic Murphy, Fernando S. Oliveira:
  Developing a market-based approach to managing the US strategic petroleum reserve. 488-495
  
• Gadi Fibich, Arieh Gavious:
  Asymptotic revenue equivalence of asymmetric auctions with interdependent values. 496-507
  

Volume 206, Number 3, November 2010

• Grammatoula Papaioannou, John M. Wilson:
  The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research. 509-521
  

• Aleksandar Savic, Jozef Kratica, Marija Milanovic, Djordje Dugosija:
  A mixed integer linear programming formulation of the maximum betweenness problem. 522-527
  
• Alper Unler, Alper Murat:
  A discrete particle swarm optimization method for feature selection in binary classification problems. 528-539
  
• Baruch Mor, Gur Mosheiov:
  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. 540-546
  
• Refael Hassin, Einat Or:
  Min sum clustering with penalties. 547-554
  
• Shouwei Guo, Liying Kang:
  Online scheduling of malleable parallel jobs with setup times on two identical machines. 555-561
  
• Sávio B. Rodrigues, Denise Sato Yamashita:
  An exact algorithm for minimizing resource availability costs in project scheduling. 562-568
  
• Jiancheng Long, Ziyou Gao, Haozhi Zhang, W. Y. Szeto:
  A turning restriction design problem in urban road networks. 569-578
  
• Uli Golle, Nils Boysen, Franz Rothlauf:
  Analysis and design of sequencing rules for car sequencing. 579-585
  

• Catherine Bobtcheff, Stéphane Villeneuve:
  Technology choice under several uncertainty sources. 586-600
  
• Chao Fu, Shanlin Yang:
  The group consensus based evidential reasoning approach for multiple attributive group decision analysis. 601-608
  
• Alois Geyer, Michael Hanke, Alex Weissensteiner:
  No-arbitrage conditions, scenario trees, and multi-asset financial optimization. 609-613
  

• David Hartvigsen:
  Optimal electronic musical instruments. 614-622
  
• Inna G. Drobouchevitch, H. Neil Geismar, Chelliah Sriskandarajah:
  Throughput optimization in robotic cells with input and output machine buffers: A comparative study of two key models. 623-633
  
• Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
  Robust network design in telecommunications under polytope demand uncertainty. 634-641
  
• Daiki Min, Yuehwern Yih:
  Scheduling elective surgery under uncertainty and downstream capacity constraints. 642-652
  
• Juan Camilo Zapata, Gintaras V. Reklaitis:
  Valuation of project portfolios: An endogenously discounted method. 653-666
  
• Dmitry Ryvkin:
  The selection efficiency of tournaments. 667-675
  

• Tapio Pahikkala, Willem Waegeman, Evgeni Tsivtsivadze, Tapio Salakoski, Bernard De Baets:
  Learning intransitive reciprocal relations with kernel methods. 676-685
  
• Rolf Färe, Shawna Grosskopf, Dimitris Margaritis:
  Time substitution with application to data envelopment analysis. 686-690
  
• Christian Schlereth, Tanja Stepanchuk, Bernd Skiera:
  Optimization and analysis of the profitability of tariff structures with two-part tariffs. 691-701
  

• Rolf Färe, Shawna Grosskopf:
  Directional distance functions and slacks-based measures of efficiency: Some clarifications. 702
  
• Xiaofeng Hu, Erfei Wu, Bao Jinsong, Jin Ye:
  A branch-and-bound algorithm to minimize the line length of a two-sided assembly line. 703-707
  

Last update Thu May 23 18:46:07 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page