Pages that link to "Item:Q2482766"
From MaRDI portal
The following pages link to A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766):
Displaying 12 items.
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
- Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
- Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem (Q3741359) (← links)
- Cost minimizing planning of container inspection and repair in multiple facilities (Q6103189) (← links)
- Planning container inspection and repair: a case study (Q6551167) (← links)
