scientific article; zbMATH DE number 1300393

DOI10.1002/(SICI)1520-6750(199812)45:8%3C817::AID-NAV4%3E3.0.CO;2-1zbMATH Open0936.90053MaRDI QIDQ4248932FDOQ4248932

Authors: Heungsoon Felix Lee, Daniel R. Dooly 

Publication date: 25 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• Algorithms for the constrained maximum-weight connected graph problem
• scientific article; zbMATH DE number 3902687
• Algorithms for the maximum weight connected \(k\)-induced subgraph problem
• The Maximum Weight Connected Subgraph Problem
• Efficient algorithms for decomposing graphs under degree constraints
• Decomposition algorithms for solving the minimum weight maximal matching problem
• scientific article
• scientific article; zbMATH DE number 568834
• New algorithms for the weighted maximum cut problem on graphs

zbMATH Keywords

communication networkdecomposition algorithmsheuristic algorithmsmaximum-weight connected graph problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (11)

• Maximum rooted connected expansion
• On the maximum connectivity improvement problem
• Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
• Vertex covering with capacitated trees
• Global optimization of multilevel electricity market models including network design and graph partitioning
• Maximum rooted connected expansion
• Decomposition of a network into minimally connected parts
• Title not available (Why is that?)
• Exploring the constrained maximum edge-weight connected graph problem
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• The Maximum Weight Connected Subgraph Problem

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