1990
DOI: 10.1287/opre.38.1.178
|View full text |Cite
|
Sign up to set email alerts
|

The Constrained Bottleneck Problem in Networks

Abstract: We consider problems on networks that are captured by two performance measures. One performance measure is any general cost function of a solution; the other is a bottleneck measure that describes the worst (maximum cost) component of the solution. The paper contains algorithms to solve three problems. In one problem, we minimize the bottleneck subject to a constraint on the generalized cost. In the second problem, we minimize the generalized cost subject to a constraint on the bottleneck. In the third problem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

1993
1993
2012
2012

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(18 citation statements)
references
References 5 publications
0
18
0
Order By: Relevance
“…We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23]. Again, note that the possible objective function values of CBTSP are the distinct edge costs of E and wez perform binary search over this set.…”
Section: Variations Of the Btspmentioning
confidence: 97%
See 1 more Smart Citation
“…We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23]. Again, note that the possible objective function values of CBTSP are the distinct edge costs of E and wez perform binary search over this set.…”
Section: Variations Of the Btspmentioning
confidence: 97%
“…Subject to H ∈ F, ∑ e∈H W e ≤B CBSTP can be solved using the general purpose algorithm of Berman et al [23], designed for general constrained bottleneck problems. We observe that a heuristic solution to CBSTP can be obtained by a simple modification of our BST-heuristic, taking insights from [23].…”
Section: Variations Of the Btspmentioning
confidence: 99%
“…Polynomial algorithms considering a sum and a bottleneck objective are presented in [11][12][13][14]. More recently, shortest path problems involving two bottleneck and a sum objective were analyzed in [15] and [16].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In location theory, center and median are two measures that reflect two different interests. Various ways of combining two objectives have been studied (see Berman, Einav and Handler 1990;Hansen 1979; and for a comprehensive text on multiple criteria decision making, Zeleny, 1982).…”
Section: Remark the Examples Shown Inmentioning
confidence: 99%