Pages that link to "Item:Q5301134"
From MaRDI portal
The following pages link to A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q5301134):
Displaying 22 items.
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Capacitated assortment and price optimization under the nested logit model (Q785637) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- On upper bounds for assortment optimization under the mixture of multinomial logit models (Q1785635) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization (Q2147143) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- Capacitated assortment and price optimization under the multilevel nested logit model (Q2294261) (← links)
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q3541795) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model (Q5058046) (← links)
- Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Approximation Algorithms for Product Framing and Pricing (Q5130488) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
- Assortment optimization with position effects under the nested logit model (Q6057929) (← links)
- Data‐driven research in retail operations—A review (Q6072168) (← links)
