The SCEAS System
Navigation Menu

Journals in DBLP

Computers & OR
2005, volume: 32, number:

  1. Chuda B. Basnet, Janny Leung
    Inventory lot-sizing with supplier selection. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1-14 [Journal]
  2. Roberto D. Galvão, Fernando Y. Chiyoshi, Reinaldo Morabito
    Towards unified formulations and extensions of two classical probabilistic location models. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:15-33 [Journal]
  3. Brunilde Sansò, André Girard, Florent Mobiot
    Integrating reliability and quality of service in networks with switched virtual circuits. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:35-58 [Journal]
  4. István Gódor, Gábor Magyar
    Cost-optimal topology planning of hierarchical access networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:59-86 [Journal]
  5. Han-Lin Li, Han-Ying Kao
    Constrained abductive reasoning with fuzzy parameters in Bayesian networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:87-105 [Journal]
  6. Alan R. McKendall Jr., James S. Noble, Cerry M. Klein
    Simulated annealing heuristics for managing resources during planned outages at electric power plants. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:107-125 [Journal]
  7. Christopher W. Zobel, William T. Scherer
    An empirical study of policy convergence in Markov decision process value iteration. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:127-142 [Journal]
  8. Yaodong Cui
    Generating optimal T-shape cutting patterns for circular blanks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:143-152 [Journal]
  9. Jeffery K. Cochran, Hung-Nan Chen
    Fuzzy multi-criteria selection of object-oriented simulation software for production system analysis. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:153-168 [Journal]
  10. Patrik Björklund, Peter Värbrand, Di Yuan
    Optimized planning of frequency hopping in cellular networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:169-186 [Journal]
  11. Nidhi Gupta, Manu Pratap Singh
    Estimation of software reliability with execution time model using the pattern mapping technique of artificial neural network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:187-199 [Journal]
  12. Chefi Triki, Patrizia Beraldi, George Gross
    Optimal capacity allocation in multi-auction electricity markets under uncertainty. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:201-217 [Journal]
  13. Gianpaolo Ghiani, Roberto Musmanno, Giuseppe Paletta, Chefi Triki
    A heuristic for the periodic rural postman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:219-228 [Journal]
  14. Ali Derbala
    Priority queuing in an operating system. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:229-238 [Journal]
  15. Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe
    Heuristic and exact algorithms for the spanning tree detection problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:239-255 [Journal]
  16. Yian-Kui Liu, Baoding Liu
    On minimum-risk problems in fuzzy random decision systems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:257-283 [Journal]
  17. Peter Chu, Kuo-Lung Yang, Patrick S. Chen
    Improved inventory models with service level and lead time. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:285-296 [Journal]
  18. Jinn-Tsair Teng, Chun-Tao Chang
    Economic production quantity models for deteriorating items with price- and stock-dependent demand. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:297-308 [Journal]
  19. Marcos Colebrook, Jose Gutiérrez, Joaquin Sicilia
    A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:309-325 [Journal]
  20. Imelda C. Perez, John W. Fowler, W. Matthew Carlyle
    Minimizing total weighted tardiness on a single batch process machine with incompatible job families. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:327-341 [Journal]
  21. Scott L. Rosen, Catherine M. Harmonosky
    An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:343-358 [Journal]
  22. Ronald G. McGarvey, Tom M. Cavalier
    Constrained location of competitive facilities in the plane. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:359-378 [Journal]
  23. Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi
    Designing radio-mobile access networks based on synchronous digital hierarchy rings. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:379-394 [Journal]
  24. Jean-Marie Bourjolly, Vianney Rebetez
    An analysis of lower bound procedures for the bin packing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:395-405 [Journal]
  25. Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández
    A compact model and tight bounds for a combined location-routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:407-428 [Journal]
  26. Ignacio Castillo, Tapio Westerlund
    An epsilon-accurate model for optimal unequal-area block layout design. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:429-447 [Journal]
  27. Satheesh Ramachandran, Dursun Delen
    Performance analysis of a kitting process in stochastic assembly systems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:449-463 [Journal]
  28. Peter I. Cowling, Ralf Keuthen
    Embedded local search approaches for routing optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:465-490 [Journal]
  29. M. Naceur Azaiez, S. S. Al Sharif
    A 0-1 goal programming model for nurse scheduling. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:491-507 [Journal]
  30. Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco
    An algorithm for ranking quickest simple paths. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:509-520 [Journal]
  31. Andy An-Kai Jeng, Bertrand M. T. Lin
    Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:521-536 [Journal]
  32. Murali Sambasivan, Salleh Yahya
    A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:537-555 [Journal]
  33. Jorge M. S. Valente, Rui A. F. S. Alves
    Improved heuristics for the early/tardy scheduling problem with no idle time. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:557-569 [Journal]
  34. Hsu-Hao Yang, Yen-Liang Chen
    Finding K shortest looping paths in a traffic-light network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:571-581 [Journal]
  35. Maghsud Solimanpur, Prem Vrat, Ravi Shankar
    An ant algorithm for the single row layout problem in flexible manufacturing systems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:583-598 [Journal]
  36. Samuel Guirchoun, Patrick Martineau, Jean-Charles Billaut
    Total completion time minimization in a computer system with a server and two parallel processors. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:599-611 [Journal]
  37. Chung-Chi Hsieh, Yi-Ting Chen
    Reliable and economic resource allocation in an unreliable flow network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:613-628 [Journal]
  38. Madhu Jain, G. C. Sharma, Chandra Shekhar
    Processor-shared service systems with queue-dependent processors. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:629-645 [Journal]
  39. Ahmet Bolat, Ibrahim Al-Harkan, Bandar Al-Harbi
    Flow-shop scheduling for three serial stations with the last two duplicate. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:647-667 [Journal]
  40. Bermawi Priyatna Iskandar, D. N. Prabhakar Murthy, N. Jack
    A new repair-replace strategy for items sold with a two-dimensional warranty. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:669-682 [Journal]
  41. Refael Hassin, Mati Shani
    Machine scheduling with earliness, tardiness and non-execution penalties. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:683-705 [Journal]
  42. Gang Li, Shouyang Wang, Hong Yan, Gang Yu
    Information transformation in a supply chain: a simulation study. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:707-725 [Journal]
  43. Diwakar Gupta, Thorkell Magnusson
    The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:727-747 [Journal]
  44. Sancho Salcedo-Sanz, José Luis Fernández-Villacañas, María Jesús Segovia-Vargas, Carlos Bousoño-Calzón
    Genetic programming for the prediction of insolvency in non-life insurance companies. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:749-765 [Journal]
  45. Bara Kim
    Maximizing service of carousel storage. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:767-772 [Journal]
  46. Yann Collette, Patrick Siarry
    Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:773-792 [Journal]
  47. Lusine Yepremyan, James E. Falk
    Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:793-812 [Journal]
  48. Wade D. Cook, Rodney H. Green
    Evaluating power plant efficiency: a hierarchical model. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:813-823 [Journal]
  49. Vincent Chi-Wei Li, Guy L. Curry
    Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:825-848 [Journal]
  50. T. C. Edwin Cheng, J. J. Yuan, A. F. Yang
    Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:849-859 [Journal]
  51. Jean-Luc Marichal, Patrick Meyer, Marc Roubens
    Sorting multi-attribute alternatives: The TOMASO method. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:861-877 [Journal]
  52. Kyu-Yeul Lee, Myung-Il Roh, Hyuk-Su Jeong
    An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:879-899 [Journal]
  53. Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen
    Scheduling two-machine no-wait open shops to minimize makespan. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:901-917 [Journal]
  54. Frederico R. B. Cruz, James MacGregor Smith, R. O. Medeiros
    An M/G/C/C state-dependent network simulation model. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:919-941 [Journal]
  55. Karabi Sikdar, U. C. Gupta
    Analytic and numerical aspects of batch service queues with single vacation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:943-966 [Journal]
  56. Haluk Topcuoglu, Fatma Corut, Murat Ermis, Gülsah Yilmaz
    Solving the uncapacitated hub location problem using genetic algorithms. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:967-984 [Journal]
  57. Jully Jeunet, Nicolas Jonard
    Single-point stochastic search algorithms for the multi-level lot-sizing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:985-1006 [Journal]
  58. Suh-Wen Chiou
    A combinatorial approximation algorithm for concurrent flow problem and its application. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1007-1035 [Journal]
  59. Gholam Reza Jahanshahloo, Majid Soleimani-Damaneh
    A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1037-1044 [Journal]
  60. Sang-Ho Kwon, Hun-Tae Kim, Maing-Kyu Kang
    Determination of the candidate arc set for the asymmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1045-1057 [Journal]
  61. Kin Keung Lai, Wan-Lung Ng
    A stochastic approach to hotel revenue optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1059-1072 [Journal]
  62. Steven Chamberland, Désiré Oulaï Khyda, Samuel Pierre
    Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1073-1087 [Journal]
  63. Víctor Suñé, Juan A. Carrasco
    Efficient implementations of the randomization method with control of the relative error. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1089-1114 [Journal]
  64. Liang Liang, Desheng Wu
    An application of pattern recognition on scoring Chinese corporations financial conditions based on backpropagation neural network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1115-1129 [Journal]
  65. Jeffrey P. Kharoufeh, Jeffrey A. Sipe
    Evaluating failure time probabilities for a Markovian wear process. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1131-1145 [Journal]
  66. Nong Ye, Esma Senturk Gel, Xueping Li, Toni Farley, Ying-Cheng Lai
    Web server QoS models: applying scheduling rules from production planning. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1147-1164 [Journal]
  67. Feiyue Li, Bruce L. Golden, Edward A. Wasil
    Very large-scale vehicle routing: new test problems, algorithms, and results. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1165-1179 [Journal]
  68. Chinho Lin, Yihsu Lin
    The production size and inventory policy for a manufacturer in a two-echelon inventory model. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1181-1196 [Journal]
  69. Jason Chao-Hsien Pan, Jen-Shiang Chen
    Mixed binary integer programming formulations for the reentrant job shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1197-1212 [Journal]
  70. Akhil Jain, Udatta S. Palekar
    Aggregate production planning for a continuous reconfigurable manufacturing process. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1213-1236 [Journal]
  71. Paul R. Harper, Valter de Senna, Israel T. Vieira, Arjan K. Shahani
    A genetic algorithm for the project assignment problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1255-1265 [Journal]
  72. Jianghua Wu
    Quantity flexibility contracts under Bayesian updating. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1267-1288 [Journal]
  73. Hans L. Trinkaus, Thomas Hanne
    knowCube: a visual and interactive support for multicriteria decision making. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1289-1309 [Journal]
  74. Mhand Hifi, Hedi M'Halla, Slim Sadfi
    An exact algorithm for the knapsack sharing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1311-1324 [Journal]
  75. Joaquín A. Pacheco
    A scatter search approach for the minimum sum-of-squares clustering problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1325-1335 [Journal]
  76. M. Naceur Azaiez, Moncer Hariga, Ibrahim Al-Harkan
    A chance-constrained multi-period model for a special multi-reservoir system. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1337-1351 [Journal]
  77. Nil Aras
    Erratum to "The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon"[Computers and Operations Research 28 (2001) 271-287]. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1353-0 [Journal]
  78. Christian Blum, Maria J. Blesa
    New metaheuristic approaches for the edge-weighted k-cardinality tree problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1355-1377 [Journal]
  79. Hao Tang, Elise Miller-Hooks
    A TABU search heuristic for the team orienteering problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1379-1407 [Journal]
  80. Tzung-Nan Chuang, Jung-Yuan Kung
    The fuzzy shortest path length and the corresponding shortest path in a network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1409-1428 [Journal]
  81. Alysson M. Costa
    A survey on benders decomposition applied to fixed-charge network design problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1429-1450 [Journal]
  82. Anne Mercier, Jean-François Cordeau, François Soumis
    A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1451-1476 [Journal]
  83. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
    Finding the K shortest hyperpaths. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1477-1497 [Journal]
  84. Haralambos Sarimveis, Athanassios Nikolakopoulos
    A line up evolutionary algorithm for solving nonlinear constrained optimization problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1499-1514 [Journal]
  85. Yahong Hu, Shell-Ying Huang, Chuanyu Chen, Wen-Jing Hsu, Ah Cheong Toh, Chee Kit Loh, Tiancheng Song
    Travel time analysis of a new automated storage and retrieval system. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1515-1544 [Journal]
  86. Frederico R. B. Cruz, James MacGregor Smith, D. C. Queiroz
    Service and capacity allocation in M/G/c/c state-dependent queueing networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1545-1563 [Journal]
  87. Christian Blum
    Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1565-1591 [Journal]
  88. David I. Mester, Olli Bräysy
    Active guided evolution strategies for large-scale vehicle routing problems with time windows. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1593-1614 [Journal]
  89. Samir Elhedhli, Frank Xiaolong Hu
    Hub-and-spoke network design with congestion. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1615-1632 [Journal]
  90. Chao-Chung Kang, Cheng-Min Feng, Haider A. Khan
    Risk assessment for build-operate-transfer projects: a dynamic multi-objective programming approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1633-1654 [Journal]
  91. Ali Emrouznejad
    Measurement efficiency and productivity in SAS/OR. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1665-1683 [Journal]
  92. Alexandre Le Bouthillier, Teodor Gabriel Crainic
    A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1685-1708 [Journal]
  93. Yaodong Cui
    A cutting stock problem and its solution in the manufacturing industry of large electric generators. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1709-1721 [Journal]
  94. Seok Bong Jeong, Sehun Kim, Heesoo Lee
    Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1723-1737 [Journal]
  95. Malcolm J. Beynon, Nigel Driffield
    An illustration of variable precision rough sets model: an analysis of the findings of the UK Monopolies and Mergers Commission. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1739-1759 [Journal]
  96. Ricardo Santiago-Mozos, Sancho Salcedo-Sanz, Mario de Prado-Cumplido, Carlos Bousoño-Calzón
    A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1761-1776 [Journal]
  97. Qian Wang, Rajan Batta, Robert J. Szczerba
    Sequencing the processing of incoming mail to match an outbound truck delivery schedule. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1777-1791 [Journal]
  98. Miro Gradisar, Peter Trkman
    A combined approach to the solution to the general one-dimensional cutting stock problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1793-1807 [Journal]
  99. Christopher W. Zobel, Loren Paul Rees, Terry R. Rakes
    Automated merging of conflicting knowledge bases, using a consistent, majority-rule approach with knowledge-form maintenance. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1809-1829 [Journal]
  100. Talel Ladhari, Mohamed Haouari
    A computational study of the permutation flow shop problem based on a tight lower bound. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1831-1847 [Journal]
  101. Francis Sourd
    Earliness-tardiness scheduling with setup considerations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1849-1865 [Journal]
  102. H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu
    The over-constrained airport gate assignment problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1867-1880 [Journal]
  103. Malcolm J. Beynon
    A method of aggregation in DS/AHP for group decision-making with the non-equivalent importance of individuals in the group. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1881-1896 [Journal]
  104. Bojan Srdjevic
    Combining different prioritization methods in the analytic hierarchy process synthesis. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1897-1919 [Journal]
  105. Jaehwan Yang
    The complexity of customer order scheduling problems on parallel machines. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1921-1939 [Journal]
  106. De-fu Zhang, An-sheng Deng
    An effective hybrid algorithm for the problem of packing circles into a larger containing circle. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1941-1951 [Journal]
  107. Carlos A. S. Oliveira, Panos M. Pardalos
    A survey of combinatorial optimization problems in multicast routing. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1953-1981 [Journal]
  108. Hélcio Vieira Jr., Marcos Pereira Estellita Lins
    An improved initial basis for the Simplex algorithm. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1983-1993 [Journal]
  109. Dong Cao, Mingyuan Chen, Guohua Wan
    Parallel machine selection and job scheduling to minimize machine cost and job tardiness. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1995-2012 [Journal]
  110. Chinyao Low
    Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2013-2025 [Journal]
  111. Ying-Ming Wang, Jian-Bo Yang, Dong-Ling Xu
    A preference aggregation method through the estimation of utility intervals. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2027-2049 [Journal]
  112. Soo Y. Chang, Hark-Chin Hwang, Sanghyuck Park
    A two-dimensional vector packing model for the efficient use of coil cassettes. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2051-2058 [Journal]
  113. Anil Kukreja, Charles P. Schmidt
    A model for lumpy demand parts in a multi-location inventory system with transshipments. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2059-2075 [Journal]
  114. Cameron G. Walker, Jody N. Snowdon, David M. Ryan
    Simultaneous disruption recovery of a train timetable and crew roster in real time. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2077-2094 [Journal]
  115. Layek L. Abdel-Malek, Roberto Montanari
    On the multi-product newsboy problem with two constraints. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2095-2116 [Journal]
  116. Peng-Sheng You, Ta-Cheng Chen
    An efficient heuristic for series-parallel redundant reliability problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2117-2127 [Journal]
  117. Der-Chiang Li, Chih-Sen Wu, Fengming M. Chang
    Determination of the parameters in the dynamic weighted Round-Robin method for network load balancing. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2129-2145 [Journal]
  118. Chung-Lun Li, Guohua Wan
    Improved algorithm for maximizing service of carousel storage. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2147-2150 [Journal]
  119. Kua-Ping Liao, Robert Fildes
    The accuracy of a procedural approach to specifying feedforward neural networks for forecasting. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2151-2169 [Journal]
  120. Wade D. Cook, Joe Zhu
    Allocation of shared costs among decision making units: a DEA approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2171-2178 [Journal]
  121. Pedro M. Talaván, Javier Yáñez
    A continuous Hopfield network equilibrium points algorithm. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2179-2196 [Journal]
  122. Józef Grabowski, Jaroslaw Pempera
    Some local search algorithms for no-wait flow-shop problem with makespan criterion. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2197-2212 [Journal]
  123. Seok Ho Chang, Dae Won Choi
    Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2213-2234 [Journal]
  124. Nong Ye, Zhibin Yang, Ying-Cheng Lai, Toni Farley
    Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2255-2269 [Journal]
  125. David Pisinger
    Where are the hard knapsack problems? [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2271-2284 [Journal]
  126. Chung-Chi Hsieh
    Replacement and standby redundancy policies in a deteriorating system with aging and random shocks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2297-2308 [Journal]
  127. Christos D. Tarantilis
    Solving the vehicle routing problem with adaptive memory programming methodology. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2309-2327 [Journal]
  128. Xian Liu
    The role of stochastic programming in communication network design. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2329-2349 [Journal]
  129. Sigrid Lise Nonås, Kai A. Olsen
    Optimal and heuristic solutions for a scheduling problem arising in a foundry. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2351-2382 [Journal]
  130. Giuseppe Confessore, Paolo Dell'Olmo, Monica Gentili
    Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2383-2405 [Journal]
  131. M. Jain, Rakhee
    A subrating channel assignment scheme for cellular radio network with directed retry. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2407-2417 [Journal]
  132. Nenad Mladenovic, Frank Plastria, Dragan Urosevic
    Reformulation descent applied to circle packing problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2419-2434 [Journal]
  133. Luis Gouveia, Pedro Martins
    The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2435-2452 [Journal]
  134. Francesca Guerriero, M. Mancini
    Experimental evaluation of solution approaches for the K-route maximum flow problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2453-2478 [Journal]
  135. Simon Dunstall, Andrew Wirth
    Heuristic methods for the identical parallel machine flowtime problem with set-up times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2479-2491 [Journal]
  136. Kate A. Smith
    Applications of neural networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2495-2497 [Journal]
  137. Qing Cao, Karyl B. Leggio, Marc J. Schniederjans
    A comparison between Fama and French's model and artificial neural networks in predicting the Chinese stock market. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2499-2512 [Journal]
  138. Wei Huang, Yoshiteru Nakamori, Shouyang Wang
    Forecasting stock market movement direction with support vector machine. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2513-2522 [Journal]
  139. Lean Yu, Shouyang Wang, Kin Keung Lai
    A novel nonlinear ensemble forecasting model incorporating GLAR and ANN for foreign exchange rates. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2523-2541 [Journal]
  140. David West, Scott Dellana, Jingxia Qian
    Neural network ensemble strategies for financial decision applications. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2543-2559 [Journal]
  141. Parag C. Pendharkar
    A threshold-varying artificial neural network approach for classification and its application to bankruptcy prediction problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2561-2582 [Journal]
  142. Shouhong Wang
    Classification with incomplete survey data: a Hopfield neural network approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2583-2594 [Journal]
  143. Frederick Kaefer, Carrie M. Heilman, Samuel D. Ramenofsky
    A neural network application to consumer classification to improve the timing of direct marketing activities. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2595-2615 [Journal]
  144. Wun-Hwa Chen, Sheng-Hsun Hsu, Hwang-Pin Shen
    Application of SVM and ANN for intrusion detection. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2617-2634 [Journal]
  145. Randall S. Sexton, Shannon McMurtrey, Joanna O. Michalopoulos, Angela M. Smith
    Employee turnover: a neural network solution. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2635-2651 [Journal]
  146. Mercedes Torres, César Hervás-Martínez, Francisco Amador
    Approximating the sheep milk production curve through the use of artificial neural networks and genetic algorithms. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2653-2670 [Journal]
  147. Sancho Salcedo-Sanz, Carlos Bousoño-Calzón
    A portable and scalable algorithm for a class of constrained combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2671-2687 [Journal]
  148. Hsin-Hsi Lai, Yang-Cheng Lin, Chung-Hsing Yeh
    Form design of product image using grey relational analysis and neural network models. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2689-2711 [Journal]
  149. Jeremy B. Noel, Kenneth W. Bauer Jr., Jeffrey W. Lanning
    Improving pilot mental workload classification through feature exploitation and combination: a feasibility study. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2713-2730 [Journal]
  150. Lars Mönch, Hari Balasubramanian, John W. Fowler, Michele E. Pfund
    Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2731-2750 [Journal]
  151. Xiuli Wang, T. C. Edwin Cheng
    Two-machine flowshop scheduling with job class setups to minimize total flowtime. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2751-2770 [Journal]
  152. Chung-Chi Hsieh, Yi-Ting Chen
    Resource allocation decisions under various demands and cost requirements in an unreliable flow network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2771-2784 [Journal]
  153. Jian Shen, Fuyong Xu, Peng Zheng
    A tabu search algorithm for the routing and capacity assignment problem in computer networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2785-2800 [Journal]
  154. Jen-Ming Chen, Liang-Tu Chen
    Pricing and production lot-size/scheduling with finite capacity for a deteriorating item over a finite horizon. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2801-2819 [Journal]
  155. Suh-Wen Chiou
    Joint optimization for area traffic control and network flow. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2821-2841 [Journal]
  156. Vincent C. Li
    Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2843-2852 [Journal]
  157. Dean H. Judson, Sitadri Bagchi, Thomas Quint
    On the inference of semi-coherent structures from data. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2853-2874 [Journal]
  158. Chyi-Bao Yang, Ue-Pyng Wen
    Applying tabu search to backup path planning for multicast networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2875-2889 [Journal]
  159. Roberto Montemanni, Luca Maria Gambardella
    Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2891-2904 [Journal]
  160. Jorge M. S. Valente, Rui A. F. S. Alves
    An exact approach to early/tardy scheduling with release dates. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2905-2917 [Journal]
  161. M. T. Almeida, F. D. Carvalho
    Exact disclosure prevention in two-dimensional statistical tables. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2919-2936 [Journal]
  162. Ali Haghani, Soojung Jung
    A dynamic vehicle routing problem with time-dependent travel times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2959-2986 [Journal]
  163. Satyaki Ghosh Dastidar, Rakesh Nagi
    Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2987-3005 [Journal]
  164. Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit
    A branch-and-cut algorithm for the pallet loading problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3007-3029 [Journal]
  165. Joaquim Júdice, Pedro Martins, Jacinto Nunes
    Workforce planning in a lotsizing mail processing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3031-3058 [Journal]
  166. Bing Wang, Yugeng Xi, Hanyu Gu
    Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3059-3072 [Journal]
  167. Joaquín A. Pacheco, Silvia Casado
    Solving two location models with few facilities by using a hybrid heuristic: a real health resources case. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3075-3091 [Journal]
  168. Alfredo Marín
    Formulating and solving splittable capacitated multiple allocation hub location problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3093-3109 [Journal]
  169. Enrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis
    New heuristic algorithms for the windy rural postman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3111-3128 [Journal]
  170. Ningxiong Xu
    Multi-period dynamic supply contracts with cancellation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3129-3142 [Journal]
  171. Bibhas Chandra Giri, Tadashi Dohi
    Computational aspects of an extended EMQ model with variable production rate. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3143-3161 [Journal]
  172. Ido Millet, Bertram Schoner
    Incorporating negative values into the Analytic Hierarchy Process. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3163-3173 [Journal]
  173. In-Jun Jeong, Kwang-Jae Kim
    D-STEM: a modified step method with desirability function concept. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3175-3190 [Journal]
  174. Jen-Ming Chen, Tsung-Hui Chen
    The multi-item replenishment problem in a two-echelon supply chain: the effect of centralization versus decentralization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3191-3207 [Journal]
  175. Bojan Srdjevic, Yvonilde Dantas Pinto Medeiros, Rubem La Laina Porto
    Data envelopment analysis of reservoir system performance. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3209-3226 [Journal]
  176. Hande Yaman, Giuliana Carello
    Solving the hub location problem with modular link capacities. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3227-3245 [Journal]
  177. Steven Chamberland
    Point of presence design in Internet protocol networks with performance guarantees. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3247-3264 [Journal]
  178. Ondrej Cepek, Shao Chin Sung
    A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3265-3271 [Journal]
  179. Jeffrey Schaller
    Note on minimizing total tardiness in a two-machine flowshop. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3273-3281 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002