The stochastic bottleneck linear programming problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3635811
- scientific article; zbMATH DE number 3928728
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- Chance constrained bottleneck spanning tree problem
- On the solution of a stochastic bottleneck assignment problem and its variations
Cites work
- A min max problem
- A min-max problem as a linear programming problem
- A note on a stochastic production-maximizing transportation problem
- A time minimising transportation problem with quantity dependent time
- Algorithms for two bottleneck optimization problems
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Bicriteria bottleneck linear programming problem
- Bottleneck linear programming
- Bottleneck Linear Programming
- CHANCE CONSTRAINED SPANNING TREE PROBLEM
- Conditions for Pareto optimality in a discrete vector problem on a system of subsets
- Confidence regional method of stochastic spanning tree problem
- Finding Minimum Spanning Trees
- Fractional programming. Theory, methods and applications
- scientific article; zbMATH DE number 3883941 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3761784 (Why is no real title available?)
- scientific article; zbMATH DE number 1034105 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- Interval elimination method for stochastic spanning tree problem
- Lexicographic bottleneck problems
- Minimal ratio spanning trees
- Minimax linear programming problem
- Minmax linear programmes with grouped variables
- On a min-max problem
- On bicriterion minimal spanning trees: An approximation
- On ranking of feasible solutions of a bottleneck linear programming problem
- On stochastic spanning tree problem
- On the bottleneck linear programming problem
- Optimal and approximate bottleneck Steiner trees
- Optimal Political Districting by Implicit Enumeration Techniques
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Stochastic bottleneck spanning tree problem
- Stochastic spanning tree problem
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The m-Center Problem: Minimax Facility Location
- The bottleneck transportation problem
- The random linear bottleneck assignment problem
- The three-dimensional bottleneck assignment problem with capacity constraints
Cited in
(7)- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
- A sixth bibliography of fractional programming
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- scientific article; zbMATH DE number 3928728 (Why is no real title available?)
- On the solution of a stochastic bottleneck assignment problem and its variations
- scientific article; zbMATH DE number 3635811 (Why is no real title available?)
- On the expected value of stochastic linear programs and (dynamic) network flow problems
This page was built for publication: The stochastic bottleneck linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304778)
