Pages that link to "Item:Q4726063"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial fractional programming problems (Q4726063):
Displaying 15 items.
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem (Q2029281) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- A Fourth bibliography of fractional programming (Q4327876) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)
- Approximation algorithms for feasible cut and multicut problems (Q6102317) (← links)
