Works matching IS 02545330 AND DT 1991 AND VI 33 AND IP 1-4

Results: 35

TOPOLOGICAL NETWORK DESIGN: ANALYSIS AND SYNTHESIS.

Published in:: Annals of Operations Research, 1991, v. 33, n. 1-4, p. 601
Publication type:: Article

STEINER MINIMAL TREES FOR THREE POINTS WITH ONE CONVEX POLYGONAL OBSTACLE.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 577, doi. 10.1007/BF02067243

By:

Winter, Pawel;
Smith, J. MacGregor

Publication type:

Article

ON GRAPHS PRESERVING RECTILINEAR SHORTEST PATHS IN THE PRESENCE OF OBSTACLES.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 557, doi. 10.1007/BF02067242

By:

Widmayer, Peter

Publication type:

Article

A SIMPLE PROOF OF HWANG'S THEOREM FOR RECTILINEAR STEINER MINIMAL TREES.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 549, doi. 10.1007/BF02067241

By:

Richards, D. S.;
Salowe, J. S.

Publication type:

Article

THE ROLE OF STEINER HULLS IN THE SOLUTION TO STEINER TREE PROBLEMS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 537, doi. 10.1007/BF02067240

By:

Provan, J. Scott

Publication type:

Article

MINIMAL LENGTH TREE NETWORKS ON THE UNIT SPHERE.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 503

By:

Dolan, John;
Weiss, Richard;
Smith, J. MacGregor

Publication type:

Article

A VARIATIONAL APPROACH TO THE STEINER NETWORK PROBLEM.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 481, doi. 10.1007/BF02071984

By:

Rubinstein, J. H.;
Thomas, D. A.

Publication type:

Article

AN APPROACH FOR THE STEINER PROBLEM IN DIRECTED GRAPHS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 471, doi. 10.1007/BF02071983

By:

Maculan, Nelson;
Souza, Paulo;
Vejar, Alfredo Candia

Publication type:

Article

THE MULTI-WEIGHTED STEINER TREE PROBLEM.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 451, doi. 10.1007/BF02071982

By:

Duin, Cees;
Volgenant, Ton

Publication type:

Article

ON STEINER RATIO CONJECTURES.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 437, doi. 10.1007/BF02071981

By:

Ding-Zhu Du

Publication type:

Article

THE STEINER RATIO FOR FIVE POINTS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 419, doi. 10.1007/BF02071980

By:

Booth, R. S.

Publication type:

Article

POLYNOMIALLY SOLVABLE SPECIAL CASES OF THE STEINER PROBLEM IN PLANAR NETWORKS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 405

By:

Bern, Marshall;
Bienstock, Daniel

Publication type:

Article

BRANCH-AND-BOUND AS A HIGHER-ORDER FUNCTION.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 379, doi. 10.1007/BF02073942

By:

Mckeown, G. P.;
Rayward-Smith, V. J.;
Turpin, H. J.

Publication type:

Article

COMPUTING SHORTEST PATHS IN NETWORKS DERIVED FROM RECURRENCE RELATIONS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 363, doi. 10.1007/BF02073941

By:

Lawler, E. L.

Publication type:

Article

LEAST-COST NETWORK TOPOLOGY DESIGN FOR A NEW SERVICE: An application of tabu search.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 351, doi. 10.1007/BF02073940

By:

Glover, Fred;
Lee, Michael;
Ryan, Jennifer

Publication type:

Article

IMPLEMENTATION OF PARALLEL BRANCH-AND-BOUND ALGORITHMS -- EXPERIENCES WITH THE GRAPH PARTITIONING PROBLEM.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 331

By:

Clausen, Jens;
Träff, Jesper Larsson

Publication type:

Article

DYNAMIC PROGRAMMING BASED HEURISTICS FOR THE TOPOLOGICAL DESIGN OF LOCAL ACCESS NETWORKS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 305, doi. 10.1007/BF02071978

By:

Gouveia, L.;
Paixão, J.

Publication type:

Article

FINDING MINIMUM COST DIRECTED TREES WITH DEMANDS AND CAPACITIES.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 285, doi. 10.1007/BF02071977

By:

Bousba, Choaib;
Wolsey, Laurence A.

Publication type:

Article

MODELS FOR PLANNING CAPACITY EXPANSION IN LOCAL ACCESS TELECOMMUNICATION NETWORKS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 239

By:

Balakrishnan, A.;
Magnanti, T. L.;
Shulman, A.;
Wong, R. T.

Publication type:

Article

SOME PROPERTIES OF GRAPH CENTROIDS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 227, doi. 10.1007/BF02115757

By:

Piotrowski, W.;
Sysło, M. M.

Publication type:

Article

MULTITERMINAL XCUT PROBLEMS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 215, doi. 10.1007/BF02115756

By:

Hassin, Refael

Publication type:

Article

ANCESTOR TREE FOR ARBITRARY MULTI-TERMINAL CUT FUNCTIONS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 199, doi. 10.1007/BF02115755

By:

Cheng, C. K.;
Hu, T. C.

Publication type:

Article

THE IMAGE OF WEIGHTED COMBINATORIAL PROBLEMS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 181, doi. 10.1007/BF02115754

By:

Camerini, P. M.;
Galbiati, G.;
Maffioli, F.

Publication type:

Article

THE MAX-CUT PROBLEM AND QUADRATIC 0-1 OPTIMIZATION; POLYHEDRAL ASPECTS, RELAXATIONS AND BOUNDS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 151, doi. 10.1007/BF02115753

By:

Boros, Endre;
Hammer, Peter L.

Publication type:

Article

ALGORITHMS FOR RECOGNITION OF REGULAR PROPERTIES AND DECOMPOSITION OF RECURSIVE GRAPH FAMILIES.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 127

By:

Borie, R.;
Parker, R. Gary;
Tovey, C. A.

Publication type:

Article

THE (δ, d, d', δ - 1)-PROBLEM WITH APPLICATIONS TO COMPUTER NETWORKS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 113, doi. 10.1007/BF02073596

By:

Yebra, J. L. A.;
Rayward-Smith, V. J.;
Revitt, A. P.

Publication type:

Article

OPTIMALLY RELIABLE NETWORKS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 107, doi. 10.1007/BF02073595

By:

Smith, D. H.

Publication type:

Article

ALTERNATIVES FOR RELIABLE AND QUALITY TELECOMMUNICATION NETWORK DESIGN.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 95, doi. 10.1007/BF02073594

By:

Kubat, Peter

Publication type:

Article

NETWORK RELIABILITY: NUMBERS OR INSIGHT? (A discussion paper).

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 87

By:

Colbourn, Charles J.

Publication type:

Article

A PRIMER OF THE EUCLIDEAN STEINER PROBLEM.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 73, doi. 10.1007/BF02061658

By:

Hwang, F. K.

Publication type:

Article

TOPOLOGICAL DESIGN OF TELECOMMUNICATION NETWORKS --LOCAL ACCESS DESIGN METHODS.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 17, doi. 10.1007/BF02061657

By:

Gavish, Bezalel

Publication type:

Article

COMBINATORIAL ASPECTS OF NETWORK RELIABILITY.

Published in:

Annals of Operations Research, 1991, v. 33, n. 1-4, p. 3, doi. 10.1007/BF02061656

By:

Colbourn, Charles J.

Publication type:

Article

PREFACE.

Published in:

1991

By:

Smith, J. MacGregor;
Winter, P.

Publication type:

Book Chapter

In Memoriam Darwin Klingman.

Published in:

1991

By:

Glover, Fred

Publication type:

Obituary

In Memoriam Paolo M. Camerini.

Published in:

1991

By:

Maffioli, Francesco

Publication type:

Obituary