An exact algorithm for multi-constrained minimum spanning tree problem

DOI10.1504/IJMOR.2018.090800zbMATH Open1452.90311OpenAlexW4235338763MaRDI QIDQ2204594

T. Jayanth Kumar, Purusotham Singamsetty

Publication date: 15 October 2020

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2018.090800

zbMATH Keywords

degree constraintpattern recognition techniquelexi-search algorithmweight constraintbudgeting constraintmulti-constrained minimum spanning tree

Mathematics Subject Classification ID

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

Related Items (5)

A strong symmetric formulation for the min-degree constrained minimum spanning tree problem ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A branch and cut algorithm for minimum spanning trees under conflict constraints ⋮ An exact solution framework for the minimum cost dominating tree problem

This page was built for publication: An exact algorithm for multi-constrained minimum spanning tree problem

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