Pages that link to "Item:Q3343777"

The following pages link to Uncapacitated lot-sizing: The convex hull of solutions (Q3343777):

Displaying 50 items.

• 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 relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• Integer-programming software systems (Q817202) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← 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)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
• Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
• Packing and covering a tree by subtrees (Q1101129) (← links)
• Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• A dual algorithm for the economic lot-sizing problem (Q1175307) (← links)
• Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
• Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
• Modelling piecewise linear concave costs in a tree partitioning problem (Q1326744) (← links)
• A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
• A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← 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)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)
• Extended formulations for stochastic lot-sizing problems (Q1785234) (← links)
• Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• A study of the lot-sizing polytope (Q1881043) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)