Pages that link to "Item:Q4286933"

The following pages link to Lot-Sizing with Constant Batches: Formulation and Valid Inequalities (Q4286933):

Displaying 50 items.

• Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
• Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
• A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
• Lot sizing with minimum order quantity (Q479047) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← 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)
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
• Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
• Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• Source sink flows with capacity installation in batches (Q1130180) (← links)
• A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
• Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
• Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
• Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
• Minimising bins in transmission systems (Q1809817) (← links)
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
• Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
• Dynamic coordination games with activation costs (Q2062251) (← links)
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← 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)
• Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
• A maritime inventory routing problem: Discrete time formulations and valid inequalities (Q2811316) (← links)
• Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
• Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
• Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
• Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
• Algorithms and extended formulations for one and two facility network design (Q4645912) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
• Single‐warehouse multi‐retailer inventory systems with full truckload shipments (Q5187943) (← links)
• Modeling industrial lot sizing problems: a review (Q5385468) (← links)