scientific article; zbMATH DE number 706867

MaRDI QIDQ4318264zbMATH OpenFDO

Authors Alexander Ageev

Publication date 12 June 1995

zbMATH Keywords

\(p\)-medianseries-parallel graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Polynomial algorithms for solving the quadratic assignment problem on networks
• Optimal location of a path or tree on a network with cycles
• scientific article; zbMATH DE number 4193445
• Polynomial algorithms to finite Veber problem for a tree network
• scientific article; zbMATH DE number 3850854

Cited in

(9)

• Polynomial algorithms to finite Veber problem for a tree network
• Algorithm for solving a problem on optimal linear ordering
• An optimal algorithm for an outerplanar facility location problem with improved time complexity
• On one polynomially solvable case of the decentralized transportation problem
• scientific article; zbMATH DE number 3845637 (Why is no real title available?)
• On the connectedness property of service areas for the Network Facility Location Problem
• Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
• A polynomial algorithm for minDSC on a subclass of series Parallel graphs
• scientific article; zbMATH DE number 4193445 (Why is no real title available?)

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 Q4318264)