Pages that link to "Item:Q4427318"
From MaRDI portal
The following pages link to Statistical Analysis of Computational Tests of Algorithms and Heuristics (Q4427318):
Displaying 23 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)
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization (Q1044246) (← links)
- A statistical analysis of an algorithm's complexity (Q1585523) (← 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 statistical evaluation of algorithmic's computational experimentation with infeasible solutions (Q1711419) (← links)
- A mixed evolutionary-statistical analysis of an algorithm's complexity (Q1861853) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← 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)
- A simple empirical formula for categorizing computing operations (Q2381324) (← 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)
- Algorithm 970 (Q3176324) (← links)
- (Q4244884) (← links)
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem (Q4319534) (← links)
- Log transformations: What not to expect when you’re expecting (Q5079877) (← links)
- Use of Representative Operation Counts in Computational Testing of Algorithms (Q5690268) (← links)
- Manipulating hidden-Markov-model inferences by corrupting batch data (Q6551078) (← links)