Computation of lower tolerances of combinatorial bottleneck problems
From MaRDI portal
Cites work
- Algorithms for two bottleneck optimization problems
- An addendum on: ``Sensitivity analysis of the optimal assignment
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Arc tolerances in shortest path and network flow problems
- Assessing the effect of multiple cost changes using reverse set tolerances
- Assignment Problems
- Bottleneck flows in unit capacity networks
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Extending single tolerances to set tolerances
- Fibonacci heaps and their uses in improved network optimization algorithms
- scientific article; zbMATH DE number 1981727 (Why is no real title available?)
- scientific article; zbMATH DE number 2064418 (Why is no real title available?)
- scientific article; zbMATH DE number 6829368 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
- On dual solutions of the linear assignment problem
- Sensitivity analysis for bottleneck assignment problems
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- The Min-Max Spanning Tree Problem and some extensions
- Variations on the bottleneck paths problem
This page was built for publication: Computation of lower tolerances of combinatorial bottleneck problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962715)
