scientific article; zbMATH DE number 3625145

MaRDI QIDQ4187615zbMATH OpenFDO

Authors Eh. Kh. Gimadi, V. A. Perepelitsa

Publication date 1974

zbMATH Keywords

Traveling Salesman ProblemNetwork ProgrammingDirected Weighted Graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)

Cited in

(7)

• A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
• 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
• The capacitated facility location problem with random input data
• An exact algorithm with linear complexity for a problem of visiting megalopolises
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187615)