Approximate binary search algorithms for mean cuts and cycles
From MaRDI portal
Publication:1319679
DOI10.1016/0167-6377(93)90022-9zbMath0802.90040OpenAlexW2079045732MaRDI QIDQ1319679
Publication date: 18 December 1994
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(93)90022-9
Related Items (6)
Computing maximum mean cuts ⋮ An approximate binary search algorithm for the multiple-choice knapsack problem ⋮ How to compute least infeasible flows ⋮ A Fast Approximation Algorithm For The Subset-Sum Problem ⋮ Approximating the minimum cycle mean ⋮ Minimax inverse problems of minimum cuts
Cites Work
- A linear time randomizing algorithm for searching ranked functions
- Parametric shortest path algorithms with an application to cyclic staffing
- New scaling algorithms for the assignment and minimum mean cycle problems
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- A characterization of the minimum cycle mean in a digraph
- A new saling algorithm for the maximum mean cut problem
- Computing maximum mean cuts
- Finding minimum-cost circulations by canceling negative cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximate binary search algorithms for mean cuts and cycles