Pages that link to "Item:Q1000957"

The following pages link to An efficient optimal algorithm for the quantity discount problem in material requirement planning (Q1000957):

Displaying 9 items.

• Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs (Q326228) (← links)
• An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
• The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
• An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← links)
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• An Algorithm for Selecting Quantity Discounts from Realistic Schedules (Q3468852) (← links)