Pages that link to "Item:Q4301284"

The following pages link to Needed: An Empirical Science of Algorithms (Q4301284):

Displaying 35 items.

• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• Generating new test instances by evolving in instance space (Q342041) (← links)
• Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
• Exploring the performance of spatial stochastic simulation algorithms (Q543671) (← links)
• Testing cut generators for mixed-integer linear programming (Q734353) (← links)
• Group-scheduling problems in electronics manufacturing (Q964869) (← links)
• AEGIS---attribute experimentation guiding improvement searches (Q1038838) (← links)
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
• On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• Decomposition methods for large job shops (Q1592580) (← 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)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← 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)
• Branching rules for satisfiability (Q1904401) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• Testing heuristics: We have it all wrong (Q1922626) (← links)
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← links)
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
• Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
• Optimal experimental design for combinatorial problems (Q2365318) (← links)
• Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
• Measuring the impact of primal heuristics (Q2450740) (← links)
• A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem (Q2468764) (← 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)
• An empirical study of phase transitions in binary constraint satisfaction problems (Q2674179) (← links)
• (Q2741519) (← links)
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
• Instance space analysis for 2D bin packing mathematical models (Q6554643) (← links)
• General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
• Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments (Q6641002) (← links)