Multiple bottleneck assignment problem

DOI10.1016/S0377-2217(97)00392-5zbMath0937.90087OpenAlexW2005973146MaRDI QIDQ1806893

Abraham P. Punnen, Yash P. Aneja

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00392-5

zbMATH Keywords

integer programmingnetwork programmingmultiple bottleneck assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30) Combinatorial optimization (90C27)

Related Items (3)

Assignment problems: a golden anniversary survey ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• Unnamed Item
• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• Minimum perfect bipartite matchings and spanning trees under categorization
• On combined minmax-minsum optimization
• Bottleneck assignment problems under categorization
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• The multiple bottleneck transportation problem
• Some Generalisations of the Time Minimising Assignment Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Categorized Assignment Scheduling: a Tabu Search Approach
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Multiple bottleneck assignment problem