This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

The stochastic bottleneck linear programming problem

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
I. Stancu-Minasian
R. Caballero
E. Cerdá
M. Muñoz

Additional information is available for the following registered author(s):

Abstract

No abstract is available for this item.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/10.1007/BF02564715
File Format: text/html
File Function:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Publisher Info
Article provided by Springer in its journal Top.

Volume (Year): 7 (1999)
Issue (Month): 1 (June)
Pages: 123-143
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:spr:topjnl:v:7:y:1999:i:1:p:123-143

Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=120409

Order Information:
Web: http://link.springer.de/orders.htm

For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).

Related research
Keywords: Stochastic Programming; Mimimum-risk approach; Bottleneck problems; Spanning trees; 90C08; 90C15; 90C90;

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

  1. K. Mathur & M. Puri & S. Bansal, 1995. "On ranking of feasible solutions of a bottleneck linear programming problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 3(2), pages 265-283, December. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? LogEc provides statistical analysis about downloads from this service (and others).

This page was last updated on 2009-12-9.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.