An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems

Let E = { e 1 , e 2 , , e n } be a finite set and $\cal F $ be a family of subsets of E . For each element e i in E , c i is a given capacity and w i is the cost of increasing capacity c i by one unit. The problem is how to expand the capacities of elements in E so that the capacity of $\cal F $ is...

Full description

Bibliographic Details

Published in:	Optimization methods & software Vol. 17; no. 1; pp. 61 - 75
Main Authors:	Zhang, Jianzhong, Liu, Zhenhong
Format:	Journal Article
Language:	English
Published:	Taylor & Francis Group 01.02.2002
Subjects:	Bottleneck Capacity Capacity Expansion Polynomially Solvable
ISSN:	1055-6788, 1029-4937
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!