Categorized bottleneck-minisum path problems on networks

DOI10.1016/0167-6377(94)90043-4zbMath0823.90122OpenAlexW1989754835MaRDI QIDQ1890954

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

shortest pathNP-completebottleneck

Mathematics Subject Classification ID

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

Related Items (3)

The Complexity of Bottleneck Labeled Graph Problems ⋮ The complexity of bottleneck labeled graph problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• The assignment problem under categorized jobs
• Traveling salesman problem under categorization
• Minimum perfect bipartite matchings and spanning trees under categorization
• Bottleneck assignment problems under categorization
• The Constrained Bottleneck Problem in Networks
• Some Generalisations of the Time Minimising Assignment Problem

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