Pages that link to "Item:Q2275813"

The following pages link to A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems (Q2275813):

Displaying 16 items.

• Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search (Q337219) (← links)
• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
• Single-point stochastic search algorithms for the multi-level lot-sizing problem (Q707016) (← links)
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems (Q875398) (← links)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
• A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem (Q1687655) (← links)
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques (Q2256324) (← links)
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
• General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain (Q2631230) (← links)
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems (Q2840764) (← links)
• (Q5318811) (← links)
• Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)