Pages that link to "Item:Q1115342"

The following pages link to Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342):

Displaying 41 items.

• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• Two-stage stochastic lot-sizing problem under cost uncertainty (Q383162) (← links)
• Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
• A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
• A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
• Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
• On the cut polyhedron. (Q1426123) (← links)
• Projections of the capacitated network loading problem (Q1577107) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
• ``Facet'' separation with one linear program (Q2330653) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← 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)
• New lot sizing heuristics for demand and price uncertainties with service-level constraint (Q3163778) (← links)
• Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
• New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)