Approximate binary search algorithms for mean cuts and cycles
type: Item
instance of: scholarly article
title: Approximate binary search algorithms for mean cuts and cycles
zbMATH Open document ID: 0802.90040
DOI: 10.1016/0167-6377(93)90022-9
author: S. Thomas McCormick
published in: Operations Research Letters
publication date: 1994-12-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 550414
zbMATH Keywords: approximate binary search algorithm
zbMATH Keywords: max mean cuts
zbMATH Keywords: min mean cycles
MaRDI profile type: Publication
full work available at URL: 0167-6377(93)90022-9
OpenAlex ID: W2079045732
cites work: Q5624995
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
cites work: Q3274170
cites work: A new saling algorithm for the maximum mean cut problem
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Parametric shortest path algorithms with an application to cyclic staffing
cites work: Computing maximum mean cuts
cites work: New scaling algorithms for the assignment and minimum mean cycle problems
cites work: Q4763405
cites work: Q4228440
cites work: A linear time randomizing algorithm for searching ranked functions
description: scientific article; zbMATH DE number 550414