On Constrained Bottleneck Extrema

Published Online:https://doi.org/10.1287/opre.40.4.813

This note treats optimization problems that involve two criteria on set systems. One is a bottleneck criterion, and the other is general. In particular, recent algorithms for such problems on the edge-sets of networks are related to the fundamental work of J. Edmonds and D. R. Fulkerson involving more general set systems.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.