Bottleneck Capacity Expansion Problems with General Budget Constraints

DOI10.1051/ro:2001100zbMath1078.90585OpenAlexW2152715506MaRDI QIDQ2765595

Bettina Klinz, Rainer E. Burkard, Zhang, Jianzhong

Publication date: 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_1_0

zbMATH Keywords

bottleneck problemstrongly polynomial algorithmalgebraic optimization.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)

Related Items (8)

Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Reverse 2-median problem on trees ⋮ On the optimum capacity of capacity expansion problems ⋮ A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric ⋮ A class of node based bottleneck improvement problems ⋮ Up- and downgrading the 1-center in a network ⋮ A sixth bibliography of fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and combinatorial optimization in ordered algebraic structures
• Modifying edges of a network to obtain short subgraphs
• Approximation algorithms for certain network improvement problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• The quickest flow problem
• An algebraic approach to assignment problems
• Maximizing the minimum source-sink path subject to a budget constraint
• A capacity scaling algorithm for the constrained maximum flow problem
• Increasing the Weight of Minimum Spanning Trees
• The network inhibition problem
• On Budgeted Optimization Problems
• A class of bottleneck expansion problems

This page was built for publication: Bottleneck Capacity Expansion Problems with General Budget Constraints