Pages that link to "Item:Q4427318"

The following pages link to Statistical Analysis of Computational Tests of Algorithms and Heuristics (Q4427318):

Displaying 12 items.

• Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization (Q342154) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• Group-scheduling problems in electronics manufacturing (Q964869) (← links)
• Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization (Q1935548) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
• Poisoning finite-horizon Markov decision processes at design time (Q2668608) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
• Log transformations: What not to expect when you’re expecting (Q5079877) (← links)