The stochastic bottleneck linear programming problem

DOI10.1007/BF02564715zbMath0932.90025OpenAlexW2050961258MaRDI QIDQ1304778

V. Pereyra

Publication date: 23 November 1999

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02564715

zbMATH Keywords

stochastic programmingspanning treesbottleneck problemsminimum-risk approach

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

A sixth bibliography of fractional programming ⋮ Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a min-max problem
• Minimax linear programming problem
• Minmax linear programmes with grouped variables
• A time minimising transportation problem with quantity dependent time
• Stochastic spanning tree problem
• On the bottleneck linear programming problem
• A min-max problem as a linear programming problem
• Lexicographic bottleneck problems
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• The three-dimensional bottleneck assignment problem with capacity constraints
• On bicriterion minimal spanning trees: An approximation
• Optimal and approximate bottleneck Steiner trees
• Conditions for Pareto optimality in a discrete vector problem on a system of subsets
• Interval elimination method for stochastic spanning tree problem
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Confidence regional method of stochastic spanning tree problem
• On ranking of feasible solutions of a bottleneck linear programming problem
• Stochastic bottleneck spanning tree problem
• Algorithms for two bottleneck optimization problems
• Bicriteria bottleneck linear programming problem
• A min max problem
• CHANCE CONSTRAINED SPANNING TREE PROBLEM
• Bottleneck Linear Programming
• Bottleneck linear programming
• Finding Minimum Spanning Trees
• Minimal ratio spanning trees
• The m-Center Problem: Minimax Facility Location
• On stochastic spanning tree problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Optimal Political Districting by Implicit Enumeration Techniques
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• A note on a stochastic production-maximizing transportation problem
• The bottleneck transportation problem
• The random linear bottleneck assignment problem

This page was built for publication: The stochastic bottleneck linear programming problem