Pages that link to "Item:Q3562403"

The following pages link to Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403):

Displaying 13 items.

• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
• New construction heuristic for capacitated lot sizing problems (Q6096617) (← links)