scientific article; zbMATH DE number 3625145
From MaRDI portal
Publication:4187615
zbMath0402.90096MaRDI QIDQ4187615
E. Kh. Gimadi, V. A. Perepelitsa
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)
Related Items (7)
Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below ⋮ An exact algorithm with linear complexity for a problem of visiting megalopolises ⋮ A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension ⋮ Uniform capacitated facility location problem with random input data ⋮ Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above ⋮ A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph ⋮ The capacitated facility location problem with random input data
This page was built for publication:
