Generalized Bottleneck Problems∗

DOI10.1080/02331939508844137zbMath0839.90096OpenAlexW2047251073MaRDI QIDQ4859828

Abraham P. Punnen, K. P. K. Nair, Yash P. Aneja

Publication date: 23 June 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844137

zbMATH Keywords

NP-hardapproximation algorithmsbottleneck problemsguaranteed error bound

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

On discrete optimization with ordering ⋮ A polynomial algorithm for a two-stage time minimizing transportation problem. ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ A class of bottleneck expansion problems ⋮ On \(k\)-Max-optimization

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
• Minmax combinatorial optimization
• An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
• Minimum perfect bipartite matchings and spanning trees under categorization
• Bottleneck assignment problems under categorization
• The Constrained Bottleneck Problem in Networks
• Combinatorial Optimization with Rational Objective Functions
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Bottleneck extrema

This page was built for publication: Generalized Bottleneck Problems^∗