Pages that link to "Item:Q2638374"
From MaRDI portal
The following pages link to Approximating a class of combinatorial problems with rational objective function (Q2638374):
Displaying 8 items.
- Ratio combinatorial programs (Q1130080) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems (Q4497873) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)