Pages that link to "Item:Q2492672"

The following pages link to An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672):

Displaying 9 items.

• Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
• A graphical approach to solve an investment optimization problem (Q483269) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← 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)
• Multi-machine scheduling with interval constrained position-dependent processing times (Q1716992) (← links)
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)