scientific article; zbMATH DE number 1256704

MaRDI QIDQ4228440zbMATH OpenFDO

Authors Tomasz Radzik

Publication date 17 January 2002

zbMATH Keywords

linear fractional combinatorial optimizationNewton's method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1302174
• A strongly polynomial algorithm for the uniform balanced network flow problem
• Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
• Ratio combinatorial programs

Cited in

(27)

• A fast bipartite network flow algorithm for selective assembly
• Approximate binary search algorithms for mean cuts and cycles
• Computing maximum mean cuts
• A strongly polynomial algorithm for the minimum cost tension problem
• Fractional 0-1 programming: applications and algorithms
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• Parametric min-cuts analysis in a network.
• An algorithm for fractional assignment problems
• Parametric analysis of overall min-cuts and applications in undirected networks.
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
• Column generation extensions of set covering greedy heuristics
• Discrete Newton methods for the evacuation problem
• The maximum ratio clique problem
• Flows over edge-disjoint mixed multipaths and applications
• A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
• Reputation games for undirected graphs
• Approximating a class of combinatorial problems with rational objective function
• Complexity of source-sink monotone 2-parameter min cut
• scientific article; zbMATH DE number 1302174 (Why is no real title available?)
• A fifth bibliography of fractional programming^*
• Maximizing residual flow under an arc destruction
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• The multiroute maximum flow problem revisited
• An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
• Assessing hierarchies by their consistent segmentations
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228440)