Categorized bottleneck-minisum path problems on networks
From MaRDI portal
Publication:1890954
DOI10.1016/0167-6377(94)90043-4zbMath0823.90122MaRDI QIDQ1890954
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
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Unnamed Item, The complexity of bottleneck labeled graph problems, The Complexity of Bottleneck Labeled Graph Problems
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