Pages that link to "Item:Q1922626"

The following pages link to Testing heuristics: We have it all wrong (Q1922626):

Displaying 50 items.

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• Generating new test instances by evolving in instance space (Q342041) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
• Testing cut generators for mixed-integer linear programming (Q734353) (← links)
• A hybrid method for multidimensional scaling using city-block distances (Q999136) (← 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)
• No more ``Partial'' and ``Full Looking Ahead'' (Q1128494) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• Evaluating general purpose automated theorem proving systems (Q1606324) (← links)
• Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
• On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
• Core instances for testing: a case study (Q1779532) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• Mixed logical-linear programming (Q1961464) (← links)
• Review on nature-inspired algorithms (Q1981936) (← links)
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
• Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
• Enhanced instance space analysis for the maximum flow problem (Q2171589) (← links)
• Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
• Metaheuristics ``In the large'' (Q2242238) (← links)
• An analysis of budgeted parallel search on conditional Galton-Watson trees (Q2309473) (← links)
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
• A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
• Optimal product design using a colony of virtual ants (Q2432923) (← links)
• How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs? (Q2463834) (← links)
• Towards a practical engineering tool for rostering (Q2468743) (← links)
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
• Machine scheduling performance with maintenance and failure (Q2643755) (← links)
• (Q2741533) (← links)
• Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
• Designing data warehouses for equipment management system with genetic algorithms (Q3605429) (← links)
• NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM (Q4791685) (← links)
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
• A statistical model-based algorithm for ‘black-box’ multi-objective optimisation (Q5172540) (← links)
• Metaheuristics—the metaphor exposed (Q5246818) (← links)
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem (Q5387635) (← links)
• COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
• A critical analysis of the “improved Clarke and Wright savings algorithm” (Q6066279) (← links)
• A multilevel evaluation method for heuristics with an application to the VRPTW (Q6088238) (← links)
• Research trends in combinatorial optimization (Q6091419) (← links)
• New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms (Q6164372) (← links)
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
• On the impact of initialisation strategies on maximum flow algorithm performance (Q6551097) (← links)