Categorized bottleneck-minisum path problems on networks

DOI10.1016/0167-6377(94)90043-4MaRDI QIDQ1890954zbMATH OpenOpenAlexFDO

Authors Igor Averbakh, Oded Berman

Publication date 28 May 1995

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)90043-4

zbMATH Keywords

bottleneckNP-completeshortest path

Mathematics Subject Classification ID

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

Recommendations

• The Constrained Bottleneck Problem in Networks
• The problems of selecting an optimal path on network
• Generalized Bottleneck Problems^∗
• scientific article; zbMATH DE number 792650
• The 2-path network problem

Cites work

• Bottleneck assignment problems under categorization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum perfect bipartite matchings and spanning trees under categorization
• Some Generalisations of the Time Minimising Assignment Problem
• The assignment problem under categorized jobs
• The Constrained Bottleneck Problem in Networks
• Traveling salesman problem under categorization

Cited in

(5)

• Bottleneck shortest paths on a partially ordered scale
• The Constrained Bottleneck Problem in Networks
• The Complexity of Bottleneck Labeled Graph Problems
• The color-balanced spanning tree problem.
• The complexity of bottleneck labeled graph problems

This page was built for publication: Categorized bottleneck-minisum path problems on networks

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