scientific article; zbMATH DE number 1256704
From MaRDI portal
Publication:4228440
zbMath0977.68546MaRDI QIDQ4228440
Publication date: 17 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Computing maximum mean cuts ⋮ A fifth bibliography of fractional programming* ⋮ Maximizing residual flow under an arc destruction ⋮ Reputation games for undirected graphs ⋮ Flows over edge-disjoint mixed multipaths and applications ⋮ Approximating a class of combinatorial problems with rational objective function ⋮ A strongly polynomial algorithm for the minimum cost tension problem ⋮ \(\varepsilon\)-approximation minimization of convex functions in fixed dimension ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications ⋮ The multiroute maximum flow problem revisited ⋮ Parametric min-cuts analysis in a network. ⋮ A fast bipartite network flow algorithm for selective assembly ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs ⋮ Discrete Newton methods for the evacuation problem ⋮ An algorithm for fractional assignment problems ⋮ Parametric analysis of overall min-cuts and applications in undirected networks. ⋮ Column generation extensions of set covering greedy heuristics ⋮ Approximate binary search algorithms for mean cuts and cycles ⋮ The maximum ratio clique problem
This page was built for publication:
