Pages that link to "Item:Q3392124"

The following pages link to A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times (Q3392124):

Displaying 48 items.

• A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← 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)
• Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (Q1730678) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Timed route approaches for large multi-product multi-step capacitated production planning problems (Q2116870) (← links)
• Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process (Q2158010) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Integrated lot sizing and blending problems (Q2668689) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
• Column generation based primal heuristics (Q2883638) (← links)
• Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403) (← links)
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
• Regenerator Location Problem in Flexible Optical Networks (Q4604897) (← 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)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• Multi-item capacitated lot-sizing problems with setup times and pricing decisions (Q5189247) (← links)
• An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
• New construction heuristic for capacitated lot sizing problems (Q6096617) (← links)
• Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing (Q6167919) (← links)
• A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control (Q6620753) (← links)