On the solution of a stochastic bottleneck assignment problem and its variations

DOI10.1002/1520-6750(199204)39:3%3C389::AID-NAV3220390308%3E3.0.CO;2-6zbMATH Open0751.90055OpenAlexW2026114366MaRDI QIDQ3989987FDOQ3989987

Authors: Prabuddha De, Jay B. Ghosh, Charles Wells 

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199204)39:3%3C389::aid-nav3220390308%3E3.0.co;2-6

Recommendations

• scientific article; zbMATH DE number 3635811
• The random linear bottleneck assignment problem
• The stochastic bottleneck linear programming problem
• The random linear bottleneck assignment problem
• A Stochastic Bottleneck Transportation Problem

zbMATH Keywords

linear assignmentbottleneck assignmentstochastic assumptions

Mathematics Subject Classification ID

Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Cites Work

• Time‐minimizing transportation problems
• Some Generalisations of the Time Minimising Assignment Problem

Cited In (5)

• Bilevel time minimizing assignment problem
• A variant of time minimizing assignment problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dynamic multilevel assignment problem as a stochastic extremal process

This page was built for publication: On the solution of a stochastic bottleneck assignment problem and its variations

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