Efficient points on a network

DOI10.1002/NET.3230160403MaRDI QIDQ3787761zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Jacques-François Thisse, Richard E. Wendell

Publication date 1986

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230160403

zbMATH Keywords

efficient points on a networklinear algorithmlocationmultiple objective problempolynomial algorithmtree

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• On the connectivity of efficient point sets
• Network optimization on partitioned pairs of points
• On the existence of efficient points
• Structure of the Efficient Point Set
• Efficient algorithms for a simple network design problem
• On the point-to-point connection problem
• Selection of efficient points
• scientific article; zbMATH DE number 515933
• Implementing efficient graphs in connection networks
• scientific article; zbMATH DE number 800234

Cites work

• A New Method of Checking the Consistency of Precedence Matrices
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)

Cited in

(6)

• Location of paths on trees with minimal eccentricity and superior section
• The point-to-point connection problem - analysis and algorithms
• Efficient algorithms for some path partitioning problems
• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
• Real world graph efficiency
• On the point-to-point connection problem

This page was built for publication: Efficient points on a network

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