Pages that link to "Item:Q2950518"

The following pages link to Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518):

Displaying 16 items.

• Decomposition based hybrid metaheuristics (Q319285) (← links)
• A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
• Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• A novel dynamic generalized opposition-based grey wolf optimization algorithm (Q2331450) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
• A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem (Q6551102) (← links)