Generalized Bottleneck Problems∗

DOI10.1080/02331939508844137MaRDI QIDQ4859828zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen, K. P. K. Nair, Y. 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

approximation algorithmsbottleneck problemsguaranteed error boundNP-hard

Mathematics Subject Classification ID

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

Recommendations

• The Constrained Bottleneck Problem in Networks
• scientific article; zbMATH DE number 1034105
• Generalized multiple objective bottleneck problems
• Weight reduction problems with certain bottleneck objectives.
• Solving combinatorial problems with combined min-max-min-sum objective and applications

Cites work

• A new polynomial-time algorithm for linear programming
• An -approximation scheme for combinatorial optimization problems with minimum variance criterion
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
• Bottleneck assignment problems under categorization
• Bottleneck extrema
• Combinatorial Optimization with Rational Objective Functions
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum perfect bipartite matchings and spanning trees under categorization
• Minmax combinatorial optimization
• The Constrained Bottleneck Problem in Networks
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(22)

• On k-Max-optimization
• Minmax combinatorial optimization
• Weight reduction problems with certain bottleneck objectives.
• Ordered weighted average optimization in multiobjective spanning tree problem
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Categorized bottleneck-minisum path problems on networks
• Constrained matroidal bottleneck problems
• Bottleneck subset-type restricted matching problems
• Bottleneck options
• A polynomial algorithm for a two-stage time minimizing transportation problem.
• A note on the asymptotic behaviour of bottleneck problems
• On the attack problem for a family of subsets
• Unlabelled Partition Systems: Optimization and Complexity
• The bottleneck problem with minimum quantity commitments
• The Constrained Bottleneck Problem in Networks
• On discrete optimization with ordering
• scientific article; zbMATH DE number 1131754 (Why is no real title available?)
• Generalized multiple objective bottleneck problems
• Algorithm Theory - SWAT 2004
• Quadratic bottleneck problems
• A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems
• A class of bottleneck expansion problems

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

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