The stochastic bottleneck linear programming problem
type: Item
instance of: scholarly article
title: The stochastic bottleneck linear programming problem
zbMATH Open document ID: 0932.90025
DOI: 10.1007/BF02564715
author: V. Pereyra
published in: Top
publication date: 1999-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1340334
zbMATH Keywords: stochastic programming
zbMATH Keywords: minimum-risk approach
zbMATH Keywords: bottleneck problems
zbMATH Keywords: spanning trees
MaRDI profile type: Publication
cites work: A time minimising transportation problem with quantity dependent time
cites work: Q3944350
cites work: Minimax linear programming problem
cites work: On a min-max problem
cites work: On bicriterion minimal spanning trees: An approximation
cites work: A min max problem
cites work: Lexicographic bottleneck problems
cites work: Minimal ratio spanning trees
cites work: Finding Minimum Spanning Trees
cites work: Conditions for Pareto optimality in a discrete vector problem on a system of subsets
cites work: Q3292914
cites work: Bottleneck Linear Programming
cites work: Algorithms for two bottleneck optimization problems
cites work: Optimal and approximate bottleneck Steiner trees
cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
cites work: The m-Center Problem: Minimax Facility Location
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: The bottleneck transportation problem
cites work: Bottleneck linear programming
cites work: On stochastic spanning tree problem
cites work: The three-dimensional bottleneck assignment problem with capacity constraints
cites work: A min-max problem as a linear programming problem
cites work: Minmax linear programmes with grouped variables
cites work: Q4344458
cites work: Confidence regional method of stochastic spanning tree problem
cites work: Stochastic bottleneck spanning tree problem
cites work: Stochastic spanning tree problem
cites work: CHANCE CONSTRAINED SPANNING TREE PROBLEM
cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
cites work: Bicriteria bottleneck linear programming problem
cites work: On ranking of feasible solutions of a bottleneck linear programming problem
cites work: Solving combinatorial problems with combined min-max-min-sum objective and applications
cites work: Interval elimination method for stochastic spanning tree problem
cites work: The random linear bottleneck assignment problem
cites work: Q4838490
cites work: On the bottleneck linear programming problem
cites work: Q3217940
cites work: Q4368736
cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
cites work: A note on a stochastic production-maximizing transportation problem
full work available at URL: https://doi.org/10.1007/bf02564715
OpenAlex ID: W2050961258
description: scientific article; zbMATH DE number 1340334