Pages that link to "Item:Q2271124"

The following pages link to Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124):

Displaying 19 items.

• Decomposition based hybrid metaheuristics (Q319285) (← links)
• A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
• A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
• Algorithms for nesting with defects (Q406491) (← links)
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
• Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A hybrid differential evolution algorithm with column generation for resource constrained job scheduling (Q2003586) (← links)
• Predictive analytics for real-time auction bidding support: a case on fantasy football (Q2079289) (← links)
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
• A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern (Q2355861) (← links)
• A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)
• Boosting an exact logic-based Benders decomposition approach by variable neighborhood search (Q2631247) (← links)
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)