A class of node based bottleneck improvement problems

DOI10.1016/J.EJOR.2005.02.054MaRDI QIDQ2503225zbMATH OpenOpenAlexFDO

Authors Xiucui Guan, Jianzhong Zhang

Publication date 14 September 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.02.054

zbMATH Keywords

dynamic programmingPareto optimalityNP-hardbottleneck improvement problemnode based upgrading model

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10)

Recommendations

• Improving spanning trees by upgrading nodes
• scientific article; zbMATH DE number 1262800
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Upgrading bottleneck constrained forests
• Improving multicut in directed trees by upgrading nodes

Cites work

• A class of bottleneck expansion problems
• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for certain network improvement problems
• Bottleneck capacity expansion problems with general budget constraints
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Improving spanning trees by upgrading nodes
• Lowering eccentricity of a tree by node upgrading
• Modifying edges of a network to obtain short subgraphs
• Network flows. Theory, algorithms, and applications.
• Optimization, approximation, and complexity classes
• Upgrading bottleneck constrained forests
• Weight reduction problems with certain bottleneck objectives.

Cited in

(4)

• Upgrading bottleneck constrained forests
• Lowering eccentricity of a tree by node upgrading
• Best upgrade plans for large road networks
• Improving multicut in directed trees by upgrading nodes

This page was built for publication: A class of node based bottleneck improvement problems

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