Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 19
Volume 19, Number 1, January 1989
- John E. Beasley
:
An SST-based algorithm for the steiner problem in graphs. 1-16 - Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Some properties of 2-threshold graphs. 17-23 - V. Krishnamoorthy, Krishnaiyan Thulasiraman, M. N. S. Swamy:
Minimum order graphs with specified diameter, connectivity, and regularity. 25-46 - Marian Mrozek:
Transitively reduced and transitively closed event networks. 47-72 - Lynne L. Doty:
Extremal connectivity and vulnerability in graphs. 73-78 - Daniel Bienstock, Clyde L. Monma:
Optimal enclosing regions in planar graphs. 79-94 - John G. Klincewicz:
Implementing an "exact" Newton method for separable convex transportation problems. 95-105 - Dominique de Werra, C. Pasche:
Paths, chains, and antipaths. 107-115 - John N. Hooker:
Solving nonlinear multiple-facility network location problems. 117-133 - Arne Bang Huseby:
Domination theory and the crapo β-invariant. 135-149 - Guo-Ray Cai, Yu-Geng Sun:
The minimum augmentation of any graph to a K-edge-connected graph. 151-172
- V. Venkateswaran:
Linear programming and network modesl, by S. K. Gupta, affiliated East-West Press Pvt. Ltd. New Delhi, 1985, 230 pp. 173
Volume 19, Number 2, March 1989
- Anantharam Balakrishnan, Stephen C. Graves:
A composite algorithm for a concave-cost network flow problem. 175-202 - R. Kevin Wood:
Triconnected decomposition for computing K-terminal network reliability. 203-220 - Fred S. Roberts, Yonghua Xu:
On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North - South Streets. 221-233 - Weigeng Shi, Ronald J. Juels:
Connected reorientations of mixed multigraphs. 235-246 - Egon Balas, Chang Sung Yu:
On graphs with polynomially solvable maximum-weight clique problem. 247-253 - Martine Labbé, Jacques-François Thisse:
A tree-network has the fixed point property. 255-259 - N. G. F. Sancho:
A functional equation for finding the largest expected capacity of a graph. 261-268
- Warren H. Lieberman:
Growth and Development, Ecosystems Phenomenology by Robert E. Ulanowicz, springer-Verlag, New York, 1986, 178 pp. 269-270
Volume 19, Number 3, May 1989
- Ali Kaveh:
On optimal cycle bases of graphs for mesh analysis of networks. 273-279 - J. Scott Provan, Vidyadhar G. Kulkarni:
Exact cuts in networks. 281-289 - Dorit S. Hochbaum, Arie Segev:
Analysis of a flow problem with fixed charges. 291-312 - Michel Minoux:
Networks synthesis and optimum network design problems: Models, solution methods and applications. 313-360 - Amos Fiat, Adi Shamir:
How to find a battleship. 361-371 - James E. Burns:
The maximum independent set problem for cubic planar graphs. 373-378
Volume 19, Number 4, July 1989
- John E. Beasley, Nicos Christofides:
An algorithm for the resource constrained shortest path problem. 379-394 - Edward J. Anderson, Andrew B. Philpott:
A continuous-time network simplex algorithm. 395-425 - Marcia P. Helme, Thomas L. Magnanti:
Designing satellite communication networks by zero - one quadratic programming. 427-450 - George R. T. Hendry:
On mean distance in certain classes of graphs. 451-457 - Réjean Lessard, Jean-Marc Rousseau, Michel Minoux:
A new algorithm for general matching problems using network flow subproblems. 459-479 - Charles E. Wells, James R. Evans:
Statistical procedures for estimating branch flows and total network flow. 481-491
Volume 19, Number 5, August 1989
- Odile Favaron, Mekkia Kouider, Maryvonne Mahéo:
Edge-vulnerability and mean distance. 493-504 - Shlomo Moran:
Message complexity versus space complexity in fault tolerant broadcast protocols. 505-519 - Timothy B. Brecht, Charles J. Colbourn:
Multiplicative improvements in network reliability bounds. 521-529 - Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth:
A branch and bound algorithm for the multiple depot vehicle scheduling problem. 531-548 - C. W. Duin, A. Volgenant:
Reduction tests for the steiner problem in grapsh. 549-567 - Stavros A. Zenios, Arne Drud, John M. Mulvey:
Balancing large social accounting matrices with nonlinear network programming. 569-585 - Edgar N. Gilbert:
A solvable routing problem. 587-594 - Pierre Hansen, Martine Labbé:
The continuous p-median of a network. 595-606 - John H. Vande Vate:
The path set polytope of an acyclic, directed graph with an application to machine sequencing. 607-614
- R. Johnson, M. G. Pilcher:
The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 pp. 615-616 - Jack Yurkiewicz:
Operations research: Applications and algorithms, by Wayne L. Winston, duxbury Press, Boston, 1987, 1025 pages. 616-618
Volume 19, Number 6, October 1989
- Egon Balas:
The prize collecting traveling salesman problem. 621-636 - Jie Sun:
Tracing the characteristic curve of a quadratic black box. 637-650 - Zevi Miller, Dan Pritikin:
On the separation number of a graph. 651-666 - Linda M. Lesniak, Raymond E. Pippert:
On the edge-connectivity vector of a graph. 667-671 - Luisa Gargano, Ugo Vaccaro:
On the construction of minimal broadcast networks. 673-689 - Charles U. Martel:
A comparison of phase and nonphase network flow algorithms. 691-705 - Abdel Aziz Farrag, Robert J. Dawson:
Designing optimal fault-tolerant star networks. 707-716 - Rajan Batta, Oded Berman:
A location model for a facility operating as an M/G/k queue. 717-728
Volume 19, Number 7, December 1989
- Yogesh Agarwal, Kamlesh Mathur, Harvey M. Salkin:
A set-partitioning-based exact algorithm for the vehicle routing problem. 731-749 - Anna Nagurney, Jay Aronson:
A general dynamic spatial price network equilibrium model with gains and losses. 751-769 - Art S. Finbow, Bert L. Hartnell:
On designing a network to defend against random attacks of radius two. 771-792 - Anjani Jain:
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks. 793-801 - David Peleg, Alejandro A. Schäffer:
Time bounds on fault-tolerant broadcasting. 803-822
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-19 20:20 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:
