Negative-cycle detection algorithms
From MaRDI portal
Publication:1300270
DOI10.1007/s101070050058zbMath0954.90057OpenAlexW2074792936MaRDI QIDQ1300270
Boris V. Cherkassky, Andrew V. Goldberg
Publication date: 9 February 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050058
Related Items
Dynamic shortest path problems with time-varying costs, USING STRATEGY IMPROVEMENT TO STAY ALIVE, M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, On Some Special Network Flow Problems: The Shortest Path Tour Problems, Efficient Fair Division with Minimal Sharing, Shortest path and maximum flow problems in networks with additive losses and gains, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines, An efficient label setting/correcting shortest path algorithm, An edge-swap heuristic for generating spanning trees with minimum number of branch vertices, Deriving priorities from inconsistent PCM using network algorithms, A robust basic cyclic scheduling problem, Pareto optimal matchings in many-to-many markets with ties, Time offset optimization in digital broadcasting, A simple GAP-canceling algorithm for the generalized maximum flow problem, Complexity analysis and optimization of the shortest path tour problem, Approximating the minimum cycle mean, A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints, Engineering Negative Cycle Canceling for Wind Farm Cabling, Finding a stabilising switching law for switching nonlinear models, Network Flow Optimization with Minimum Quantities, Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm, A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
