Pages that link to "Item:Q5138257"

The following pages link to Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257):

Displaying 27 items.

• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem (Q2076890) (← links)
• Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach (Q2083942) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
• Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service (Q2673569) (← links)
• Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning (Q5058000) (← links)
• Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)
• A nested benders decomposition-based algorithm to solve the three-stage stochastic optimisation problem modeling population-based breast cancer screening (Q6168579) (← links)