Pages that link to "Item:Q319285"

The following pages link to Decomposition based hybrid metaheuristics (Q319285):

Displaying 17 items.

• An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
• A matheuristic approach for the design of multiproduct batch plants with parallel production lines (Q1631517) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Scheduling medical residents' training at university hospitals (Q1755256) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
• Recent advances in selection hyper-heuristics (Q2183846) (← links)
• Metaheuristics ``In the large'' (Q2242238) (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
• A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
• A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• An integer programming column generation principle for heuristic search methods (Q6066729) (← links)