Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Bottleneck capacity expansion problems with general budget constraints

Rainer E. Burkard; Bettina Klinz; Jianzhong Zhang — 2001

RAIRO - Operations Research - Recherche Opérationnelle

This paper presents a unified approach for bottleneck capacity expansion problems. In the bottleneck capacity expansion problem, BCEP, we are given a finite ground set $E$ , a family $ℱ$ of feasible subsets of $E$ and a nonnegative real capacity ${\hat{c}}_{e}$ for all $e \in E$ . Moreover, we are given monotone increasing cost functions $f_{e}$ for increasing the capacity of the elements $e \in E$ as well as a budget $B$ . The task is to determine new capacities $c_{e} \geq {\hat{c}}_{e}$ such that the objective function given by ${max}_{F \in ℱ} {min}_{e \in F} c_{e}$ is maximized under the side constraint...

Bottleneck Capacity Expansion Problems with General Budget Constraints

Rainer E. Burkard; Bettina Klinz; Jianzhong Zhang — 2010

RAIRO - Operations Research

This paper presents a unified approach for bottleneck capacity expansion problems. In the bottleneck capacity expansion problem, BCEP, we are given a finite ground set , a family of feasible subsets of and a nonnegative real capacity ĉ for all . Moreover, we are given monotone increasing cost functions for increasing the capacity of the elements as well as a budget . The task is to determine new capacities c ≥ ĉ such that the objective function given by maxminc is...

Page 1

Download Results (CSV)