Pages that link to "Item:Q1762054"

The following pages link to Measuring instance difficulty for combinatorial optimization problems (Q1762054):

Displaying 34 items.

• An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
• Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
• A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
• 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)
• Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
• Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
• A cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• Instance spaces for machine learning classification (Q1707470) (← links)
• Advancing Shannon entropy for measuring diversity in systems (Q1722720) (← links)
• A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
• A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
• Instance space analysis for a personnel scheduling problem (Q2043438) (← links)
• Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• Enhanced instance space analysis for the maximum flow problem (Q2171589) (← links)
• Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
• Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem (Q2279759) (← links)
• Selecting algorithms for large berth allocation problems (Q2294627) (← links)
• Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• The representation of partially-concurrent open shop problems (Q2398435) (← links)
• Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
• Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations (Q2830959) (← links)
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
• Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)
• The international timetabling competition on sports timetabling (ITC2021) (Q6112712) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)