Pages that link to "Item:Q1804648"

The following pages link to Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648):

Displaying 50 items.

• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
• Two-stage stochastic lot-sizing problem under cost uncertainty (Q383162) (← links)
• Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
• Lot sizing with minimum order quantity (Q479047) (← links)
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
• On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
• A note on the split rank of intersection cuts (Q647399) (← links)
• Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
• A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
• Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
• Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
• A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results (Q1761836) (← links)
• Extended formulations for stochastic lot-sizing problems (Q1785234) (← links)
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Multi-stage simultaneous lot-sizing and scheduling for flow line production (Q1936588) (← links)
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
• Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
• Lot sizing with inventory gains (Q2467450) (← links)
• Lot-sizing with production and delivery time windows (Q2492704) (← links)
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
• On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
• Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Approximate extended formulations (Q2583138) (← links)
• An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
• A maritime inventory routing problem: Discrete time formulations and valid inequalities (Q2811316) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
• The Mixing Set with Divisible Capacities (Q3503864) (← links)
• Campaign planning in time-indexed model formulations (Q4671374) (← links)
• Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)