Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 21
Volume 21, Number 1, January 1994
- John W. Chinneck:
MINOS(IIS): Infeasibility analysis using MINOS. 1-9 - Noel Bryson, Saul I. Gass:
Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm. 11-17 - Frits C. R. Spieksma
:
A branch-and-bound algorithm for the two-dimensional vector packing problem. 19-25 - Vincent A. Barker, Bo Friis Nielsen:
Using program package NSPCG to analyze the trunk reservation service protection method. 27-37 - Amiya K. Chakravarty, Sanjoy Ghose:
Strategic underproduction with product switching. 39-56 - Joanna M. Leleno:
Adjustment process-based approach for computing a Nash-Cournot equilibrium. 57-65 - Hyo-Seong Lee, Sang Kuk Kim:
Optimal dispatching of an infinite capacity shuttle with compound poisson arrivals: Control at a single terminal. 67-78 - Ross A. Gerrard, Richard L. Church:
Analyzing tradeoffs between zonal constraints and accessibility in facility location. 79-99 - Steven E. Butt, Tom M. Cavalier:
A heuristic for the multiple tour maximum collection problem. 101-111
Volume 21, Number 2, February 1994
- Gen-Huey Chen, Yung-Chen Hung:
Algorithms for the constrained quickest path problem and the enumeration of quickest paths. 113-118 - David Ben-Arieh, Ping-Teng Chang:
An extension to the p-median group technology algorithm. 119-125 - Shouhong Wang, Norman P. Archer:
A neural network technique in modeling multiple criteria multiple person decision making. 127-142 - Shouhong Wang:
Neural network techniques for monotonic nonlinear models. 143-154 - Prakash L. Abad:
Supplier pricing when the buyer's annual requirements are fixed. 155-167 - Stan Lipovetsky, Asher Tishler:
Linear methods in multimode data analysis for decision making. 169-183 - Evangelos Triantaphyllou, Allen L. Soyster, Soundar R. T. Kumara:
Generating logical expressions from positive and negative examples via a branch-and-bound approach. 185-197 - Pao-Long Chang, Shiuh-Nan Hwang, Chiang Kao:
Some good multipliers for random number generator for 16-bit microcomputers. 199-204 - Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. 205-210 - Elsayed A. Elsayed, Mohammed Ettouney:
Perturbation analysis of linear programming problems with random parameters. 211-224
Volume 21, Number 3, March 1994
- Lance A. Matheson, J. Pirie Hart, Theodore D. Klastorin:
The optimal design of personalized bank check printing plates. 225-238 - Bezalel Gavish, Suresh Sridhar:
O(n) algorithms for load balancing in distributed computing systems. 239-248 - Bill C. Hardgrave, Rick L. Wilson, Kent A. Walstrom:
Predicting graduate student success: A comparison of neural networks and traditional techniques. 249-263 - John N. Hooker, Hong Yan, Ignacio E. Grossmann, Ramesh Raman:
Logic cuts for processing networks with fixed charges. 265-279 - Marc J. Schniederjans, Karen D. Loch:
An aid for strategic marketing in the banking industry: A Markov analysis. 281-287 - Surendra M. Gupta, Emanuel Melachrinoudis:
Complementarity and equivalence in finite source queueing models with spares. 289-296 - Sushant Jain, J. MacGregor Smith:
Open finite queueing networks with M/M/C/K parallel servers. 297-317 - Han-Lin Li:
A new global approach for 0-1 polynomial programs. 319-327 - Adam Fadlalla, James R. Evans, Martin S. Levy:
A greedy heuristic for the mean tardiness sequencing problem. 329-336 - Gölgen Bengü, Juan Carlos Ortiz:
Telecommunications systems maintenance. 337-351 - Kao-Chêng Lin, Maw-Sheng Chern:
The single most vital arc in the most economical path problem - A parametric analysis. 353-358
Volume 21, Number 4, April 1994
- Brian Borchers, John E. Mitchell:
An improved branch and bound algorithm for mixed integer nonlinear programs. 359-367 - Yong Sun Choi, Soung Hie Kim:
An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors. 369-384 - Layek Abdel-Malek, Chi Tang:
A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system. 385-396 - Takeo Yamada, J. Yoruzuya, Seiji Kataoka:
Enumerating extreme points of a highly degenerate polytope. 397-410 - Tej S. Dhakar, Charles P. Schmidt, David M. Miller:
Base stock level determination for high cost low demand critical repairable spares. 411-420 - Kemal Altinkemer:
Topological design of ring networks. 421-431 - Ami Arbel:
A multiobjective interior primal-dual linear programming algorithm. 433-445 - Yuemin Ding, Alok Baveja, Rajan Batta:
Implementing larson and sadiq's location model in a geographic information system. 447-454 - Stephen M. Hart, Chuen-Lung Chen:
Simulated annealing and the mapping problem: A computational study. 455-461 - Hong Chich Chou, Chung-Ping Chung:
Optimal multiprocessor task scheduling using dominance and equivalence relations. 463-475
Volume 21, Number 5, May 1994
- V. Sridharan, R. Lawrence LaForge:
A model to estimate service levels when a portion of the master production schedule is frozen. 477-486 - Ahmet Bolat, Mehmet Savsar, Mohammed A. Al-Fawzan:
Algorithms for real-time scheduling of jobs on mixed model assembly lines. 487-498 - X. Cai, C. J. Goh:
A fast heuristic for the train scheduling problem. 499-510 - Jianzhong Zhang, Dan Sha:
A priority measure in interval methods for constrained global optimization. 511-519 - Jeffrey L. Riggs, Sheila B. Brown, Robert P. Trueblood:
Integration of technical, cost, and schedule risks in project management. 521-533 - William Hurley:
Adjacent vertex simplex algorithms: More experimental results on random problems. 535-541 - Zilla Sinuany-Stern, Abraham Mehrez, Arieh Barboy:
Academic departments efficiency via DEA. 543-556 - Oded Herman, Zvi Ganz:
The capacity expansion problem in the service industry. 557-572 - Katherine J. Toussaint, Bruce L. Golden:
Exchange heuristics to improve the clarity of base/time plots. 573-586 - Joaquim Júdice, Fernanda M. Pires:
A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems. 587-596
Volume 21, Number 6, July 1994
- Umesh Chandra Gupta, T. S. S. Srinivasa Rao:
A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/K. 597-605 - William E. Stein, Murray J. Côté:
Scheduling arrivals to a queue. 607-614 - N. K. Jaiswal, B. S. Nagabhushana:
Combat modeling with spatial effects, reserve deployment and termination decision rules. 615-628 - Stuart L. Harshbarger, Vladimir A. Greenberg:
Utility least cost planning and the washington gas integrated model. 629-640 - Wen Lea Pearn, Mao Lin Li:
Algorithms for the Windy Postman Problem. 641-651 - Gur Mosheiov:
Scheduling jobs under simple linear deterioration. 653-659 - Hamidreza Amindavar, James A. Ritcey, Arun K. Somani:
Analytical computation of Markov chain using Padé approximations. 661-675 - John J. Bernardo, Kun-Si Lin:
An interactive procedure for bi-criteria production scheduling. 677-688 - Farid Harche, Gerald L. Thompson:
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems. 689-705 - Abraham P. Punnen:
On combined minmax-minsum optimization. 707-716
Volume 21, Number 7, August 1994
- T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz:
One-machine batching and sequencing of multiple-type items. 717-721 - Francis J. Nourie, Faruk Güder:
A restricted-entry method for a transportation problem with piecewise-linear concave costs. 723-733 - Robert C. Soltysik, Paul R. Yarnold:
The WARMACK-GONZALEZ algorithm for linear two-category multivariable optimal discriminant analysis. 735-745 - Yaw O. Chang, John K. Karlof:
Large scale geometric programming: An application in coding theory. 747-755 - Steven T. Breslawski, Stanley Zionts:
A simulation based study of modifications to the Zionts-Wallenius algorithm for multiple objective linear programming. 757-768 - C. S. Sung, B. K. Yoo:
Parametric max flow problems in a class of networks with series-parallel structure. 769-776 - Kurt M. Bretthauer, A. Victor Cabot:
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron. 777-785 - B. V. Cadambi:
One machine scheduling to minimize expected mean tardiness - Part II. 787-795
Volume 21, Number 8, October 1994
- Samuel J. Raff:
Preface. 797- - S. Selçuk Erengüç, Hasan Pirkul:
Foreword : Heuristic, Genetic and Tabu Search. 799 - Fred W. Glover:
Optimization by ghost image processes in neural networks. 801-822 - David L. Woodruff:
Simulated annealing and tabu search: Lessons from a line search. 823-839 - Oya Icmeli, S. Selçuk Erengüç:
A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows. 841-853 - Jadranka Skorin-Kapov:
Extensions of a tabu search adaptation to the quadratic assignment problem. 855-865 - John Knox:
Tabu search performance on the symmetric traveling salesman problem. 867-876 - Roland Hübscher, Fred W. Glover:
Applying tabu search with influential diversification to multiprocessor scheduling. 877-884 - James P. Kelly, Manuel Laguna, Fred W. Glover:
A study of diversification strategies for the quadratic assignment problem. 885-893 - Hasan Pirkul, Erik Rolland:
New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation. 895-907 - Haldun Aytug, Gary J. Koehler, Jane L. Snowdon:
Genetic learning of dynamic scheduling within a simulation environment. 909-925 - Anna-Lena Nordström, Süleyman Tüfekci:
A genetic algorithm for the talent scheduling problem. 927-940 - Sencer Yeralan, C.-S. Lin:
Genetic search with dynamic operating disciplines. 941-954 - Daniel G. Conway, M. A. Venkataramanan:
Genetic search and the dynamic facility layout problem. 955-960
Volume 21, Number 9, November 1994
- Clark Jeffries, Tim Niznik:
Easing the conscience of the guilty net. 961-968 - I. M. Premachandra, Liliana González:
An exact solution to a class of queueing systems with multipurpose counters. 969-977 - Charles Ernie Love, Kim Fung Lam:
Classifying and controlling errors in forecasting using multiple criteria goal programming. 979-989 - Jun Wang:
A neural network approach to modeling fuzzy preference relations for multiple criteria decision making. 991-1000 - Stephen E. Bechtold, Michael J. Brusco:
A microcomputer-based heuristic for tour scheduling of a mixed workforce. 1001-1009 - Won J. Lee, A. Victor Cabot, Munirpallam A. Venkataramanan:
A branch and bound algorithm for solving separable convex integer programming problems. 1011-1024 - Bruno-Laurent Garcia, Jean-Yves Potvin, Jean-Marc Rousseau:
A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints. 1025-1033 - Chiang Kao, J. Y. Wong:
Several extensively tested random number generators. 1035-1039
Volume 21, Number 10, December 1994
- Weizhen Mao, Rex K. Kincaid:
A look-ahead heuristic for scheduling jobs with release dates on a single machine. 1041-1050 - Norman D. Curet:
An incremental primal-dual method for generalized networks. 1051-1059 - Ely Merzbach, Boris Singer:
How to construct a partition when preference sets are given. 1061-1068 - Les G. Proll, Abdellah Salhi:
A note on a maximum distance problem. 1069-1072 - Cheryl Gaimon, Johnny C. Ho:
Uncertainty and the acquisition of capacity: A competitive analysis. 1073-1088 - Chiang Kao:
Decomposition with simulated division for efficiently generating random numbers. 1089-1093 - Ching-Jong Liao:
A new node selection strategy in the branch-and-bound procedure. 1095-1101 - Erhan Erkut, Yilmaz Ülküsal, Oktay Yeniçerioglu:
A comparison of p-dispersion heuristics. 1103-1113 - John R. Gum, James A. Chisman:
An operations research information system (ORIS). 1115-1127
a service of 
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-04-16 20:19 CEST 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:
