default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 20
Volume 20, Number 1, January 1990
- Merrill M. Flood:
Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem. 1-23 - Nagraj Balakrishnan, Richard T. Wong:
A network model for the rotating workforce scheduling problem. 25-42 - Kathie Cameron:
An algorithmic note on the gallai-milgram theorem. 43-48 - Richard D. Wollmer:
An airline tail routing algorithm for periodic schedules. 49-54 - Shlomo Moran, Ilan Newman, Yaron Wolfstahl:
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. 55-64 - Jane Nichols Hagstrom:
Directed network reliability: Domination and computing coefficients of the success-marginal expansion. 65-78 - Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Anti-stalling pivot rules for the network simplex algorithm. 79-91 - Dan Trietsch:
Interconnecting networks in the plane: The steiner case. 93-108 - Marshall W. Bern:
Faster exact algorithms for steiner trees in planar networks. 109-120
Volume 20, Number 2, March 1990
- Hossein Soroush, Pitu B. Mirchandani:
The stochastic multicommodity flow problem. 121-155 - Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa:
Efficient algorithms for finding maximum cliques of an overlap graph. 157-171 - Ding-Zhu Du, D. Frank Hsu, Qiao Li, Junming Xu:
A combinatorial problem related to distributed loop networks. 173-180 - Thomas A. Feo, Mallek Khellaf:
A class of bounded approximation algorithms for graph partitioning. 181-195 - Martine Labbé
:
Location of an obnoxious facility on a network: A voting approach. 197-207 - Daniel Granot, Mehran Hojati:
On cost allocation in communication networks. 209-229 - Jane N. Hagstrom:
Computing the probability distribution of project duration in a PERT network. 231-244
Volume 20, Number 3, May 1990
- Dimitris Bertsimas:
The probabilistic minimum spanning tree problem. 245-275 - Louis D. Nel, Charles J. Colbourn:
Combining monte carlo estimates and bounds for network reliability. 277-298 - Appajosyula Satyanarayana, L. Tung:
A characterization of partial 3-trees. 299-322 - Caterina De Simone, Mario Lucertini, Stefano Pallottino, Bruno Simeone:
Fair dissections of spiders, worms, and caterpillars. 323-344 - Monique Guignard, Moshe B. Rosenwein:
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. 345-359
Volume 20, Number 4, July 1990
- Donald K. Wagner:
Disjoint (s, t)-cuts in a network. 361-371 - Bala Shetty:
A heuristic algorithm for a network problem with variable upper bounds. 373-389 - Michael B. Richey:
Optimal location of a path or tree on a network with cycles. 391-407 - Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki:
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities. 409-426 - Takeo Yamada, Leslie R. Foulds:
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey. 427-452 - Pankaj K. Agarwal, Man-tak Shing:
Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle. 453-485
Volume 20, Number 5, August 1990
- Ross D. Shachter:
Introduction. 487-489 - Steffen L. Lauritzen, A. Philip Dawid, B. N. Larsen, Hanns-Georg Leimer:
Independence properties of directed markov fields. 491-505 - Dan Geiger, Thomas Verma, Judea Pearl:
Identifying independence in bayesian networks. 507-534 - Ross D. Shachter:
An ordered examination of influence diagrams. 535-563 - Carlos Alberto De Bragança Pereira, Richard E. Barlow:
Medical diagnosis using influence diagrams. 565-577 - David J. Spiegelhalter, Steffen L. Lauritzen:
Sequential updating of conditional probabilities on directed graphical structures. 579-605 - David Heckerman:
Probabilistic similarity networks. 607-636 - Finn Verner Jensen, Kristian G. Olesen, Stig K. Andersen:
An algebra of bayesian belief universes for knowledge-based systems. 637-659 - R. Martin Chavez, Gregory F. Cooper:
A randomized approximation algorithm for probabilistic inference on bayesian belief networks. 661-685 - Michael P. Wellman:
Graphical inference in qualitative probabilistic networks. 687-701
Volume 20, Number 6, October 1990
- Michael O. Ball, Ulrich Derigs, C. Hilbrand, Achim Metz:
Matching problems with generalized upper bound side constraints. 703-721 - Derek H. Smith, Lynne L. Doty:
On the construction of optimally reliable graphs. 723-729 - Anant H. V. Lyer, John J. Jarvis, H. Donald Ratliff:
Hierarchical solution of network flow problems. 731-752 - Abilio Lucena:
Time-dependent traveling salesman problem-the deliveryman case. 753-763 - Weiguo Liu:
A lower bound for the steiner tree problem in directed graphs. 765-778 - Timothy Law Snyder, J. Michael Steele:
Worst-case greedy matchings in the unit d-cube. 779-800
- Arvind Rajan:
Theory of linear and integer programming, by Alexander Schrijver, Wiley, New York, 1986, 471 pp. Price $71.95. 801
Volume 20, Number 7, December 1990
- David Simchi-Levi, Oded Berman:
Optimal locations and districts of two traveling salesmen on a tree. 803-815 - Edward J. Anderson, M. A. Aramendia:
The search game on a network with immobile hider. 817-844 - Jörg Peters:
The network simplex method on a multiprocessor. 845-859 - Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in store-and-forward networks. 861-881 - Hosam M. Aboelfotoh, Charles J. Colbourn:
Efficient algorithms for computing the reliability of permutation and interval graphs. 883-898
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-02-21 19:21 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:
