The following pages link to (Q3579452):
Displayed 6 items.
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand (Q2806071) (← links)
- (Q5002731) (← links)