default search action
Computers & Operations Research, Volume 29
Volume 29, Number 1, January 2002
- Giuseppe Bruno, Michel Gendreau, Gilbert Laporte:
A heuristic for the location of a rapid transit line. 1-12 - Tore Grünert, Stefan Irnich
, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst:
Finding all k-cliques in k-partite graphs, an application in textile engineering. 13-31 - I-Ming Chao:
A tabu search method for the truck and trailer routing problem. 33-51 - Elham Ghashghai, Ronald L. Rardin:
Using a hybrid of exact and genetic algorithms to design survivable networks. 53-66 - Saïd Salhi
Defining tabu list size and aspiration criterion within tabu search methods. 67-86 - M. Montaz Ali
A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. 87-102
Volume 29, Number 2, February 2002
- Ming-Guang Huang, Pao-Long Chang, Ying-Chyi Chou:
Buffer allocation in flow-shop-type production systems with general arrival and service patterns. 103-121 - Jatinder N. D. Gupta
Local search heuristics for two-stage flow shop problems with secondary criterion. 123-149 - Kathleen Steinhöfel
Fast parallel heuristics for the job shop scheduling problem. 151-169 - Yongwon Seo
Optimal reorder decision utilizing centralized stock information in a two-echelon distribution system. 171-193 - Hsing Luh, Ray Tsaih
An efficient search direction for linear programming problems. 195-203
Volume 29, Number 3, March 2002
- Norman D. Curet, Jason DeVinney, Matthew E. Gaston
An efficient network flow code for finding all minimum cost s-t cutsets. 205-219 - Gue-woong Jeong, Kyungsik Lee, Sungsoo Park, Kyungchul Park:
A branch-and-price algorithm for the Steiner tree packing problem. 221-241 - Christos Valouxis, Efthymios Housos
Combined bus and driver scheduling. 243-259 - Richard Y. K. Fung
Extension of a hybrid Genetic Algorithm for nonlinear programming problems with equality and inequality constraints. 261-274 - Chang Sup Sung, Young Hwan Kim:
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. 275-294 - Amir H. Abdekhodaee, Andrew Wirth:
Scheduling parallel machines with a single server: some solvable cases and heuristics. 295-315
Volume 29, Number 4, April 2002
- Tongryeol Seol, Soondal Park:
Solving linear systems in interior-point methods. 317-326 - Indranil Bose, Raktim Pal:
Average waiting time of customers in a priority M/D/k queue with finite buffers. 327-339 - Shangyao Yan, Tuntai Tung, Yu-Ping Tu:
Optimal construction of airline individual crew pairings. 341-363 - Roberto Baldacci
A new method for solving capacitated location problems based on a set partitioning approach. 365-386 - Mohamed A. Ahmed, Talal M. Alkhamis:
Simulation-based optimization using simulated annealing with ranking and selection. 387-402 - K. Rajashree Kamath
A Bayesian approach to a dynamic inventory model under an unknown demand distribution. 403-422
Volume 29, Number 5, April 2002
- Lawrence Leemis:
Computing the nonparametric estimator of the survivor function when all observations are either left- or right-censored with tied observation times. 423-431 - So Young Sohn:
Robust design of server capability in M/M/1 queues with both partly random arrival and service rates. 433-440 - Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.:
The cable trench problem: combining the shortest path and minimum spanning tree problems. 441-458 - Moshe Eben-Chaime
Capacitated location-allocation problems on a line. 459-470 - Liang-Yuh Ouyang
A minimax distribution free procedure for mixed inventory model involving variable lead time with fuzzy demand. 471-487 - Yi-Kuang Chen, Shih-Wei Lin
An efficient two-staged approach for generating block layouts. 489-504 - Kurt M. Bretthauer, Bala Shetty:
A pegging algorithm for the nonlinear resource allocation problem. 505-527 - Jeffery K. Cochran, Theodore P. Lewis:
Computing small-fleet aircraft availabilities including redundancy and spares. 529-540
Volume 29, Number 6, May 2002
- Richard L. Church:
Geographical information systems and location science. 541-562 - Oded Berman, Dmitry Krass:
The generalized maximal covering location problem. 563-581 - Vedat Verter:
An integrated model for facility location and technology acquisition. 583-592 - Nicoletta Ricciardi, Roberto Tadei
Optimal facility location with random throughput costs. 593-607 - José Fernández
Estimating actual distances by norm functions: a comparison between the lk, p, theta-norm and the lb1, b2, theta-norm and a study about the selection of the data set. 609-623 - Jack Brimberg, George O. Wesolowsky:
Locating facilities by minimax relative to closest points of demand areas. 625-636 - Zvi Drezner, Stefan H. Steiner, George O. Wesolowsky:
On the circle closest to a set of points. 637-650 - Luce Brotcorne, Gilbert Laporte, Frédéric Semet
Fast heuristics for large scale covering-location problems. 651-665 - Steven J. D'Amico, Shoou-Jiun Wang, Rajan Batta, Christopher M. Rump:
A simulated annealing approach to police district design. 667-684 - Shoou-Jiun Wang, Joyendu Bhadury
Supply facility and input/output point locations in the presence of barriers. 685-699 - Rex K. Kincaid, Sharon L. Padula:
D-optimal designs for sensor and actuator locations. 701-713 - Gabriela Mayer, Bernd Wagner:
HubLocator: an exact solution method for the multiple allocation hub location problem. 715-739 - Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega
Locating stations on rapid transit lines. 741-759 - Jorge H. Jaramillo, Joy Bhadury, Rajan Batta:
On the use of genetic algorithms to solve location problems. 761-779 - Horst A. Eiselt, John R. Current:
Special issue on location analysis.
Volume 29, Number 7, June 2002
- Zhi-Long Chen, Shanling Li, Devanath Tirupati:
A scenario-based stochastic programming approach for technology and capacity planning. 781-806 - Lionel Dupont, Clarisse Dhaenens-Flipo
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. 807-819 - Krzysztof Fleszar
New heuristics for one-dimensional bin-packing. 821-839 - Kunihiko Hiraishi, Eugene Levner, Milan Vlach
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. 841-848 - Chat Srivaree-ratana, Abdullah Konak
Estimation of all-terminal network reliability using an artificial neural network. 849-868 - Jason Chao-Hsien Pan, Jen-Shiang Chen, Chii-Ming Chao:
Minimizing tardiness in a two-machine flow-shop. 869-885 - Angel Corberán, Rafael Martí
The Rural Postman Problem on mixed graphs with turn penalties. 887-903 - Chu-Fu Wang, Chun-Teng Liang, Rong-Hong Jan:
Heuristic algorithms for packing of multiple-group multicasting. 905-924 - Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit:
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. 925-947
Volume 29, Number 8, July 2002
- Bruce Curry, Peter H. Morgan, Mick Silver
Neural networks and non-linear statistical methods: an application to the modelling of price-quality relationships. 951-969 - Ali Allahverdi, Fawaz S. Al-Anzi
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. 971-994 - C. S. Sung, Y. I. Choung, J. M. Hong, Y. H. Kim:
Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. 995-1007 - Youngshin Park, Sooyoung Kim, Chi-Hyuck Jun:
Mean value analysis of re-entrant line with batch machines and multi-class jobs. 1009-1024 - James S. Finan, William J. Hurley:
The analytic hierarchy process: can wash criteria be ignored? 1025-1030 - Clark D. Jeffries:
Design rules for application specific dynamical systems. 1031-1039 - Gordian Schilling, Michael C. Georgiadis
An algorithm for the determination of optimal cutting patterns. 1041-1058 - M. Selim Akturk
Dynamic lot sizing and tool management in automated manufacturing systems. 1059-1079 - Herbert F. Lewis, Susan A. Slotnick:
Multi-period job selection: planning work loads to maximize profit. 1081-1098 - Sung A. Cho, Chae-Bogk Kim, Dong Hoon Lee:
Single machine MAD/Tmax problem with a common due date. 1099-1113
Volume 29, Number 9, August 2002
- Francisco J. Arcelus, T. P. M. Pakkala, Gopalan Srinivasan:
A myopic policy for the gradual obsolescence problem with price-dependent demand. 1115-1127 - Jacques Renaud
Perturbation heuristics for the pickup and delivery traveling salesman problem. 1129-1141 - Eugene J. Zak:
Row and column generation technique for a multistage cutting stock problem. 1143-1156 - Chae Y. Lee, Hee K. Cho:
Port partitioning and dynamic queueing for IP forwarding. 1157-1172 - Siddhartha S. Syam:
A model and methodologies for the location problem with logistical components. 1173-1193 - Konstantin Kogan
Scheduling one-part-type serial manufacturing system under periodic demand: a solvable case. 1195-1206 - Miro Gradisar, Gortan Resinovic, Miroljub Kljajic:
Evaluation of algorithms for one-dimensional cutting. 1207-1220 - Mauricio Solar
A parallel genetic algorithm to solve the set-covering problem. 1221-1235 - Jaques Reifman, Earl E. Feldman:
Multilayer perceptron for nonlinear programming. 1237-1250 - Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen:
The total completion time open shop scheduling problem with a given sequence of jobs on one machine. 1251-1266 - Kyung Sang Lee, Kyung Sam Park, Soung Hie Kim:
Dominance, potential optimality, imprecise information, and hierarchical structure in multi-criteria analysis. 1267-1281
Volume 29, Number 10, September 2002
- William G. Ferrell Jr.
Design of economically optimal acceptance sampling plans with inspection error. 1283-1300 - Suk-Hun Yoon, José A. Ventura:
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. 1301-1315 - Kenneth E. Rosing, M. John Hodgson:
Heuristic concentration for the p-median: an example demonstrating how and why it works. 1317-1330 - Umesh Chandra Gupta, Veena Goswami
Performance analysis of finite buffer discrete-time queue with bulk service. 1331-1341 - Giuseppe Paletta
The period traveling salesman problem: a new heuristic algorithm. 1343-1352 - Marcos Escobar, Amedeo R. Odoni, Emily Roth:
Approximate solution for multi-server queueing systems with Erlangian service times. 1353-1374 - Anito Joseph:
A concurrent processing framework for the set partitioning problem. 1375-1391 - Tai-Hsi Wu
Heuristic solutions to multi-depot location-routing problems. 1393-1415 - Jatinder N. D. Gupta
Heuristics for hybrid flow shops with controllable processing times and assignable due dates. 1417-1439 - Edward Yu-Hsien Lin, Dennis L. Bricker:
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming. 1441-1446
Volume 29, Number 11, September 2002
- Jiafu Tang, Richard Y. K. Fung
A new approach to quality function deployment planning with financial consideration. 1447-1463 - Joseph Kreimer:
Real-time system with homogeneous servers and nonidentical channels in steady-state. 1465-1473 - R. J. Kuo, L. M. Ho, Clark M. Hu:
Integration of self-organizing feature map and K-means algorithm for market segmentation. 1475-1493 - Jing-Shing Yao, Teng-San Shih:
Fuzzy revenue for fuzzy demand quantity based on interval-valued fuzzy sets. 1495-1535 - Rafael Caballero
Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems. 1537-1558 - Shangyao Yan, Chich-Hwang Tseng:
A passenger demand model for airline flight scheduling and fleet routing. 1559-1581 - Amy Hing Ling Lau, Hon-Shiang Lau:
The effects of reducing demand uncertainty in a manufacturer-retailer channel for single-period products. 1583-1602 - Samuel J. Raff:
Editorial. 1603- - Din-Horng Yeh:
A note on "a simple heuristic for maximizing service of carousel storage". 1605-1608 - Elkafi Hassini
Comments on a note by Jacobs, Peck and Davis. 1609-1610
Volume 29, Number 12, October 2002
- Achyutha Krishnamoorthy, T. G. Deepak
Modified N-policy for M/G/1 queues. 1611-1620 - Cheng-Shuo Wang, Reha Uzsoy
A genetic algorithm to minimize maximum lateness on a batch processing machine. 1621-1640 - Ko-Hsin Liang, Xin Yao
A new evolutionary approach to cutting stock problems with and without contiguity. 1641-1659 - Yong Kyoon Lee, Kyung Sam Park, Soung Hie Kim:
Identification of inefficiencies in an additive model based IDEA (imprecise data envelopment analysis). 1661-1676 - Salvador Nieto Sánchez, Evangelos Triantaphyllou
An incremental learning algorithm for constructing Boolean functions from positive and negative examples. 1677-1700 - Liang-Yuh Ouyang
Quality improvement, setup cost and lead-time reductions in lot size reorder point models with an imperfect production process. 1701-1717 - Ue-Pyng Wen, Tsung-Lin Wu, Ching-Chir Shyur:
Bi-directional self-healing ring network planning. 1719-1737 - Maria Jesus Lopez-Herrero:
On the number of customers served in the M/G/1 retrial queue: first moments and maximum entropy approach. 1739-1757 - Alexandre Linhares
Connections between cutting-pattern sequencing, VLSI design, and flexible machines. 1759-1772
Volume 29, Number 13, November 2002
- Walter J. Gutjahr
A branch-and-bound approach to the optimization of redundant software under failure correlation. 1773-1791 - Jaehyun Yeo, Heesoo Lee, Sehun Kim:
An efficient broadcast scheduling algorithm for TDMA ad-hoc networks. 1793-1806 - Chung-Chi Hsieh:
Smoothness in frame reduction. 1807-1818 - Sheng-Pen Wang:
On inventory replenishment with non-linear increasing demand. 1819-1825 - Peter Chu
A note on inventory replenishment policies for deteriorating items in an exponentially declining market. 1827-1842 - Wei-Chang Yeh
Search for all d-Mincuts of a limited-flow network. 1843-1858 - Matthew J. Katz, Klara Kedem, Michael Segal
Improved algorithms for placing undesirable facilities. 1859-1872 - Anant Singh Jain, Sheik Meeran
A multi-level hybrid framework applied to the general flow-shop scheduling problem. 1873-1901 - Gianpaolo Ghiani
The capacitated plant location problem with multiple facilities in the same site. 1903-1912 - S. Reza Hejazi, Azizollah Memariani, Gholam Reza Jahanshahloo, Mohammad Mehdi Sepehri
Linear bilevel programming solution by genetic algorithm. 1913-1925 - Yi-Kuei Lin:
Two-commodity reliability evaluation for a stochastic-flow network with node failure. 1927-1939
Volume 29, Number 14, December 2002
- Gautam Choudhury:
A batch arrival queue with a vacation time under single vacation policy. 1941-1955 - T. C. Edwin Cheng
Common due date assignment and scheduling with ready times. 1957-1967 - Chian-Son Yu:
A GP-AHP method for solving group decision-making fuzzy AHP problems. 1969-2001 - Behnam Malakooti, Jumah E. Al-alwani:
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming problems. 2003-2021 - L. Douglas Smith, Robert M. Nauss, Robert J. Banis, Ronald Beck:
Staffing geographically distributed service facilities with itinerant personnel. 2023-2041 - Sheng-Pen Wang:
An inventory replenishment policy for deteriorating items with shortages and partial backlogging. 2043-2051 - B. W. Conolly, P. R. Parthasarathy, N. Selvaraju
Double-ended queues with impatience. 2053-2072 - Sakib A. Mondal
Minimization of squared deviation of completion times about a common due date. 2073-2085 - T. C. Edwin Cheng
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. 2087-2091
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: