Improved polynomial algorithms for robust bottleneck problems with interval data
From MaRDI portal
Publication:1046706
DOI10.1016/j.cor.2009.03.013zbMath1177.90188OpenAlexW2038103561MaRDI QIDQ1046706
Publication date: 22 December 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.013
Related Items
Single machine scheduling problems with uncertain parameters and the OWA criterion, Lawler's minmax cost problem under uncertainty, Minimizing maximum cost for a single machine under uncertainty of processing times, Sensitivity analysis for bottleneck assignment problems, Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
Cites Work
- Unnamed Item
- The computational complexity of the relative robust shortest path problem with interval data
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- An augmenting path method for solving linear bottleneck assignment problems
- The partial sum criterion for Steiner trees in graphs and shortest paths
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Robust discrete optimization and its applications
- On the complexity of the robust spanning tree problem with interval data
- Minmax regret solutions for minimax optimization problems with uncertainty
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Algorithms for two bottleneck optimization problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
