Probabilistic Analysis of Some Combinatorial Optimization Problems on Networks |
Common terms and phrases
A.H.G. RINNOOY analysis of combinatorial ANGELES THE UNIVERSI approximation arc i,j arc lengths asymptotically optimal BORGWARDT c₂ CALIFORN CALIFORNIA combinatorial optimization problems complete graphs computed convergence denote diam distribution function EC(Zn Euclidean exodic tree expected length exponential formulation FOULDS Frenk Frieze Graphs with Random GRIMMETT Heuristic i.i.d random variables Integer Programming Karp Lemma LIBRARYO linear programming linear programming relaxation LOS ANGELES lower bound LP relaxation Magnanti and Wong Math minimal spanning tree MST length network design network provisioning NLOS ANGELES nodes of G NP-complete numbering Opns optimal value pair of nodes PRIM Prim-numbered Probabilistic Analysis Problem in Graphs problem on networks Proc Random Graphs random minimal spanning REN model RHEE shortest path problems SIAM side constraints Simplex Method Sparsity factor Steiner Problem Steiner tree problem Stochastic TALAGRAND Theorem 2.3 uncapacitated UNIVERS THE LIBRARY UNIVERSI LOS ANGELES UNIVERSITY x-Pos X₁ Zemel