Approximating a class of combinatorial problems with rational objective function
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256704 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- scientific article; zbMATH DE number 3313421 (Why is no real title available?)
- A characterization of the minimum cycle mean in a digraph
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- A primal–dual schema based approximation algorithm for the element connectivity problem
- An algorithm for fractional assignment problems
- Approximation algorithms for combinatorial fractional programming problems
- Approximation algorithms for fractional knapsack problems
- Biconnectivity approximations and graph carvings
- Combinatorial Optimization with Rational Objective Functions
- Duality and Sensitivity Analysis for Fractional Programs
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- LATIN 2004: Theoretical Informatics
- New scaling algorithms for the assignment and minimum mean cycle problems
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Optimization, approximation, and complexity classes
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
- The complexity of minimum ratio spanning tree problems
- The fractional prize-collecting Steiner tree problem on trees (extended abstract)
Cited in
(9)- Fractional 0-1 programming: applications and algorithms
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
- Exact and Approximation Algorithms for the Expanding Search Problem
- Capacity constraints across nests in assortment optimization under the nested logit model
- On the tightness of an LP relaxation for rational optimization and its applications
- A PTAS for a class of binary non-linear programs with low-rank functions
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- Combinatorial optimization with rational objective functions
- Approximating Rational Objectives Is as Easy as Approximating Linear Ones
This page was built for publication: Approximating a class of combinatorial problems with rational objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638374)
