On the optimum capacity of capacity expansion problems
From MaRDI portal
Publication:2472185
DOI10.1007/s00186-007-0147-zzbMath1136.90008MaRDI QIDQ2472185
Zhang, Jianzhong, Chao Yang, Chunyan Hao
Publication date: 20 February 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-007-0147-z
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Improving the location of minisum facilities through network modification
- An inverse maximum capacity path problem with lower bound constraints
- Approximation algorithms for certain network improvement problems
- Weight reduction problems with certain bottleneck objectives.
- Some reverse location problems
- On budget-constrained flow improvement.
- Bottleneck Capacity Expansion Problems with General Budget Constraints
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A class of bottleneck expansion problems
- A capacity expansion problem with budget constraint and bottleneck limitation