A GENERALIZED OPTIMUM REQUIREMENT SPANNING TREE PROBLEM WITH A MONGE-LIKE PROPERTY

DOI10.15807/JORSJ.43.417MaRDI QIDQ4538191zbMATH OpenOpenAlexFDO

Authors Tsutomu Anazawa

Publication date 11 July 2002

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.43.417

zbMATH Keywords

tree network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)

Recommendations

• An explicit solution of a generalized optimum requirement spanning tree problem with a property related to Monge
• OPTIMUM REQUIREMENT HAMILTON CYCLE PROBLEM WITH A MONGE-LIKE PROPERTY
• Optimum requirement spanning trees and reliability of tree networks
• Optimum Communication Spanning Trees in Series-Parallel Networks
• scientific article; zbMATH DE number 1154587

Cited in

(3)

• OPTIMUM REQUIREMENT HAMILTON CYCLE PROBLEM WITH A MONGE-LIKE PROPERTY
• An explicit solution of a generalized optimum requirement spanning tree problem with a property related to Monge
• Element perturbation problems of optimum spanning trees with two-parameter objectives

This page was built for publication: A GENERALIZED OPTIMUM REQUIREMENT SPANNING TREE PROBLEM WITH A MONGE-LIKE PROPERTY

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