Abstract
We study combinatorial optimization problems with bottleneck objective function, where any feasible solution has the same number of elements. In addition to minimizing the largest element of a feasible solution we are interested in minimizing also the second largest element, the third largest element, and so on. For this version of the bottleneck problem two generic solution procedures are developed and analyzed. The first is based on scaling the cost elements. In the second approach an optimal solution is constructed iteratively. Both methods have polynomial running time, provided the underlying sum optimization problem is polynomially solvable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
