default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 1
Volume 1, Number 1, Winter 1989
- Harvey J. Greenberg:
Editor's Introduction. 1 - Robert G. Jeroslow, Jinchang Wang:
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base. 7-19 - Stavros A. Zenios:
Parallel Numerical Optimization: Current Status and an Annotated Bibliography. 20-43 - Jaya Singhal, Roy E. Marsten, Thomas L. Morin:
Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System. 44-51 - Daniel P. Heyman, Alyson Reeves:
Numerical Solution of Linear Equations Arising in Markov Chain Models. 52-60
Volume 1, Number 2, Spring 1989
- Harvey J. Greenberg:
Editor's Introduction. 61 - Farhad Shahrokhi:
Approximation Algorithms for the Maximum Concurrent Flow Problem. 62-69 - Kevin A. McShane, Clyde L. Monma, David F. Shanno:
An Implementation of a Primal-Dual Interior Point Method for Linear Programming. 70-83 - Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. 84-106 - Tapas K. Som, Robert G. Sargent:
A Formal Development of Event Graphs as an Aid to Structured and Efficient Simulation Programs. 107-125 - Andrew L. Reibman, Kishor S. Trivedi, Sanjaya Kumar, Gianfranco Ciardo
:
Analysis of Stiff Markov Chains. 126-133
Volume 1, Number 3, Summer 1989
- Harvey J. Greenberg:
Editor's Introduction. 135-136 - John N. Hooker:
Input Proofs and Rank One Cutting Planes. 137-145 - Masahiro Inuiguchi, Hidetomo Ichihashi, Hideo Tanaka:
Possibilistic Linear Programming with Measurable Multiattribute Value Functions. 146-158 - Paul T. Boggs, Paul D. Domich, Janet R. Donaldson, Christoph Witzgall:
Algorithmic Enhancements to the Method of Centers for Linear Programming Problems. 159-171 - Burton Simon:
A New Estimator of Sensitivity Measures for Simulations Based on Light Traffic Theory. 172-180 - Avi Dechter, Rina Dechter:
On the Greedy Solution of Ordering Problems. 181-189 - Fred W. Glover:
Tabu Search - Part I. 190-206
Volume 1, Number 4, Fall 1989
- Harvey J. Greenberg:
Editor's Introduction. 207-208 - Hosam M. Aboelfotoh, Charles J. Colbourn:
Series-Parallel Bounds for the Two-Terminal Reliability Problem. 209-222 - Robert L. Moose Jr.:
Modeling Networks with Dynamic Topologies. 223-231 - Eitan Wacholder:
A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem. 232-246 - Andrew T. Phillips, J. Ben Rosen:
Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming. 247-251 - Stein W. Wallace, Roger J.-B. Wets:
Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks. 252-270 - Larry J. LeBlanc, Ronald V. Simmons:
Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks. 271-286 - Roy E. Marsten, Matthew J. Saltzman, David F. Shanno, George S. Pierce, J. F. Ballintijn:
Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. 287-297
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 2025-12-02 23:28 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:
