Nidhi Gupta, Manu Pratap Singh: Estimation of software reliability with execution time model using the pattern mapping technique of artificial neural network.
187-199
Scott L. Rosen, Catherine M. Harmonosky: An improved simulated annealing simulation optimization method for discrete parameter stochastic systems.
343-358
Bara Kim: Maximizing service of carousel storage.
767-772
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.
773-792
Lusine Yepremyan, James E. Falk: Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems.
793-812
Vincent Chi-Wei Li, Guy L. Curry: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search.
825-848
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.
849-859
Víctor Suñé, Juan A. Carrasco: Efficient implementations of the randomization method with control of the relative error.
1089-1114
Liang Liang, Desheng Wu: An application of pattern recognition on scoring Chinese corporations financial conditions based on backpropagation neural network.
1115-1129
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].
1353-
Volume 32, Number 6, June 2005
Christian Blum, Maria J. Blesa: New metaheuristic approaches for the edge-weighted k-cardinality tree problem.
1355-1377
Yaodong Cui: A cutting stock problem and its solution in the manufacturing industry of large electric generators.
1709-1721
Seok Bong Jeong, Sehun Kim, Heesoo Lee: Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users.
1723-1737
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.
1739-1759
Malcolm J. Beynon: A method of aggregation in DS/AHP for group decision-making with the non-equivalent importance of individuals in the group.
1881-1896
Bojan Srdjevic: Combining different prioritization methods in the analytic hierarchy process synthesis.
1897-1919
Jaehwan Yang: The complexity of customer order scheduling problems on parallel machines.
1921-1939
Volume 32, Number 8, August 2005
De-fu Zhang, An-sheng Deng: An effective hybrid algorithm for the problem of packing circles into a larger containing circle.
1941-1951
David Pisinger: Where are the hard knapsack problems?
2271-2284
Emerson C. Colin, Roberto da Costa Quinino: An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions.
2285-2296
Chung-Chi Hsieh: Replacement and standby redundancy policies in a deteriorating system with aging and random shocks.
2297-2308
Christos D. Tarantilis: Solving the vehicle routing problem with adaptive memory programming methodology.
2309-2327
Xian Liu: The role of stochastic programming in communication network design.
2329-2349
Sigrid Lise Nonås, Kai A. Olsen: Optimal and heuristic solutions for a scheduling problem arising in a foundry.
2351-2382
Parag C. Pendharkar: A threshold-varying artificial neural network approach for classification and its application to bankruptcy prediction problem.
2561-2582
Shouhong Wang: Classification with incomplete survey data: a Hopfield neural network approach.
2583-2594
Xiuli Wang, T. C. Edwin Cheng: Two-machine flowshop scheduling with job class setups to minimize total flowtime.
2751-2770
Chung-Chi Hsieh, Yi-Ting Chen: Resource allocation decisions under various demands and cost requirements in an unreliable flow network.
2771-2784
Jian Shen, Fuyong Xu, Peng Zheng: A tabu search algorithm for the routing and capacity assignment problem in computer networks.
2785-2800
Jen-Ming Chen, Liang-Tu Chen: Pricing and production lot-size/scheduling with finite capacity for a deteriorating item over a finite horizon.
2801-2819
Suh-Wen Chiou: Joint optimization for area traffic control and network flow.
2821-2841
Vincent C. Li: Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints.
2843-2852
Bing Wang, Yugeng Xi, Hanyu Gu: Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem.
3059-3072
Volume 32, Number 12, December 2005
Articles from the Conference on Routing and Location (CORAL), Tenerife, February 2003 Guest Editor:
Juan Jose Salazar Gonzalez
Joaquín A. Pacheco, Silvia Casado: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case.
3075-3091
Ido Millet, Bertram Schoner: Incorporating negative values into the Analytic Hierarchy Process.
3163-3173
In-Jun Jeong, Kwang-Jae Kim: D-STEM: a modified step method with desirability function concept.
3175-3190
Jen-Ming Chen, Tsung-Hui Chen: The multi-item replenishment problem in a two-echelon supply chain: the effect of centralization versus decentralization.
3191-3207
data released under the ODC-BY 1.0 license
