Minmax regret solutions for minimax optimization problems with uncertainty
Author:
- Igor AverbakhIAIgor Averbakh
- 1 September 2000
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 27 (2) , 57-65
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Minmax Regret Median Location on a Network Under UncertaintyINFORMS Journal on Computing, 2000
- Minmax-regret robust 1-median location on a treeNetworks, 1998
- How to use expert adviceJournal of the ACM, 1997
- Bottleneck Steiner Subnetwork Problems with k-Connectivity ConstraintsINFORMS Journal on Computing, 1996
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphsDiscrete Applied Mathematics, 1992
- m-Median and m-Center Problems with Mutual Communication: Solvable Special CasesOperations Research, 1992
- Distance‐constrained multifacility minimax location problems on tree networksNetworks, 1992
- Universal PortfoliosMathematical Finance, 1991
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice DestinationsTransportation Science, 1987
- The min-max spanning tree problem and some extensionsInformation Processing Letters, 1978