![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
INFORMS Journal on Computing, Volume 2
Volume 2, Number 1, Winter 1990
- Harvey J. Greenberg:
Editor's Introduction. 1-2 - Fred W. Glover
:
Tabu Search - Part II. 4-32 - Jadranka Skorin-Kapov:
Tabu Search Applied to the Quadratic Assignment Problem. 33-45 - David E. Whited, Douglas R. Shier, James P. Jarvis:
Reliability Computations for Planar Networks. 46-60 - John Gleeson, Jennifer Ryan:
Identifying Minimally Infeasible Subsystems of Inequalities. 61-63 - Chung-Lun Li, David Simchi-Levi:
Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems. 64-73 - Miguel Delgado, José L. Verdegay, Maria-Amparo Vila:
On Valuation and Optimization Problems in Fuzzy Graphs: A General Approach and Some Particular Cases. 74-83 - Allan Tuchman, Michael W. Berry:
Matrix Visualization in the Design of Numerical Algorithms. 84-92 - Richard H. Jones:
Book Review. 93 - Harvey J. Greenberg:
Computational Testing: Why, How and How Much. 94-97
Volume 2, Number 2, Spring 1990
- Harvey J. Greenberg:
Editor's Introduction. 99 - Allen L. Barker, Donald E. Brown, Worthy N. Martin:
A Neural Network Implementation of a Data Association Algorithm. 100-111 - Stavros A. Zenios:
Matrix Balancing on a Massively Parallel Connection Machine. 112-125 - Bennett L. Fox:
Generating Markov-Chain Transitions Quickly: I. 126-135 - Christopher V. Jones:
An Introduction to Graph-Based Modeling Systems, Part I: Overview. 136-151 - Irvin J. Lustig
:
The Influence of Computer Language on Computational Comparisons: An Example from Network Optimization. 152-161 - David M. Nicol:
Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems. 162-173 - James P. Kelly, Bruce L. Golden, Arjang A. Assad:
Using Simulated Annealing to Solve Controlled Rounding Problems. 174-185 - Fernando L. Alvarado:
Manipulation and Visualization of Sparse Matrices. 186-207
Volume 2, Number 3, Summer 1990
- Harvey J. Greenberg:
Editor's Introduction. 209-210 - Edward P. C. Kao, Kumar S. Narayanan:
Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue. 211-218 - Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni:
Optimal Preemptive Scheduling of Two Unrelated Processors. 219-224 - Christodoulos A. Floudas, Avanish Aggarwal:
A Decomposition Strategy for Global Optimum Search in the Pooling Problem. 225-235 - Bezalel Gavish, Kemal Altinkemer:
Backbone Network Design Tools with Economic Tradeoffs. 236-252 - Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/ Weighted Regions with Applications. 253-272 - Mohan L. Chaudhry, Carl M. Harris, William G. Marchal:
Robustness of Rootfinding in Single-Server Queueing Models. 273-286 - Michael V. Mannino, Betsy S. Greenberg, Sa Neung Hong:
Model Libraries: Knowledge Representation and Reasoning. 287-301
Volume 2, Number 4, Fall 1990
- Harvey J. Greenberg:
Editor's Introduction. 303 - In Chan Choi, Clyde L. Monma, David F. Shanno:
Further Development of a Primal-Dual Interior Point Method. 304-311 - Amiya K. Chakravarty, Diptendu Sinha:
Knowledge Modularization for Adaptive Decision Modeling. 312-324 - Uwe H. Suhl, Leena Suhl:
Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases. 325-335 - Che-Liang Yang, Peter Kubat:
An Algorithm for Network Reliability Bounds. 336-345 - Joseph Y.-T. Leung, Gilbert H. Young:
Minimizing Total Tardiness on a Single Machine with Precedence Constraints. 346-352 - Kendall E. Nygard, Paul Juell, Nagesh Kadaba:
Neural Networks for Selective Vehicle Routing Heuristics. 353-364 - Matthew J. Saltzman, Kevin S. McCurley
:
Book Reviews. 365-368
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.