Measuring instance difficulty for combinatorial optimization problems
From MaRDI portal
Recommendations
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- What makes an optimization problem hard?.
- A complex-networks view of hard combinatorial search spaces
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Experimental evaluation of heuristic optimization algorithms: A tutorial
Cites work
- scientific article; zbMATH DE number 1728530 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 1241385 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2040652 (Why is no real title available?)
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 953062 (Why is no real title available?)
- scientific article; zbMATH DE number 1857651 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 956851 (Why is no real title available?)
- scientific article; zbMATH DE number 2229025 (Why is no real title available?)
- scientific article; zbMATH DE number 2243360 (Why is no real title available?)
- 10.1162/153244303322753616
- A Bayesian approach to tackling hard computational problems. (Preliminary report)
- A combinatorial characterization of the testable graph properties, it's all about regularity
- A hard knapsack problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A note on some computationally difficult set covering problems
- A review of metrics on permutations for search landscape analysis
- A study of complexity transitions on the asymmetric traveling salesman problem
- Algorithms for some hard knapsack problems
- An Algorithm for Large Zero-One Knapsack Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An introduction to timetabling
- Approximation algorithms for NP-hard problems.
- Cheeger Constant and Connectivity of Graphs
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Comparison of iterative searches for the quadratic assignment problem
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Designing and reporting on computational experiments with heuristic methods
- Determining computational complexity from characteristic ``phase transitions
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Edge cuts leaving components of order at least \(m\)
- Efficient testing of large graphs
- Evolution towards the maximum clique
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Formulations and Reformulations in Integer Programming
- GAUSS: an online algorithm selection system for numerical quadrature
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Generating applicable synthetic instances for branch problems
- Generating hard satisfiability problems
- Graph Classes: A Survey
- Graph coloring with adaptive evolutionary algorithms
- Hard Knapsack Problems
- Heuristic solution of open bin packing problems
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Landscapes, operators and heuristic search
- Learning dynamic algorithm portfolios
- Objective function features providing barriers to rapid global optimization
- On the Convergence of an Algorithm for Best Tchebycheff Approximations
- On the classification of NP-complete problems in terms of their correlation coefficient
- On the facial structure of the set covering polytope
- Open problems of Paul Erd�s in graph theory
- PYTHIA
- Paramils: an automatic algorithm configuration framework
- Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
- Phase Transitions in Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Problem structure heuristics and scaling behavior for genetic algorithms
- Property testing in bounded degree graphs
- Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results
- Reactive local search for the maximum clique problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- SOFSEM 2004: Theory and Practice of Computer Science
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Solving large quadratic assignment problems on computational grids
- Some Examples of Difficult Traveling Salesman Problems
- Statistical mechanics of the vertex-cover problem
- Synthetic optimization problem generation: show us the correlations!
- Testing heuristics: We have it all wrong
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- The TSP phase transition
- The \(ACO/F-Race\) algorithm for combinatorial optimization under uncertainty
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The landscape of the traveling salesman problem
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems.
- The quadratic assignment problem
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- What makes an optimization problem hard?.
- Where are the hard knapsack problems?
Cited in
(49)- The representation of partially-concurrent open shop problems
- A global search framework for practical three-dimensional packing with variable carton orientations
- Instance space analysis for 2D bin packing mathematical models
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- On the summary measures for the resource-constrained project scheduling problem
- Evolving test instances of the Hamiltonian completion problem
- A new class of hard problem instances for the 0-1 knapsack problem
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- Which algorithm to select in sports timetabling?
- Algorithm runtime prediction: methods \& evaluation
- Advancing Shannon entropy for measuring diversity in systems
- Towards objective measures of algorithm performance across instance space
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- The international timetabling competition on sports timetabling (ITC2021)
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- On the potential of normalized TSP features for automated algorithm selection
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Unified encoding for hyper-heuristics with application to bioinformatics
- A step counting hill climbing algorithm applied to university examination timetabling
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Solving the selective multi-category parallel-servicing problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Accelerating the branch-and-price algorithm using machine learning
- Machine scheduling instance generation by reverse engineering from instance space analysis
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Instance space analysis for a personnel scheduling problem
- Scheduling with uncertain processing times in mixed-criticality systems
- Generating hard instances for robust combinatorial optimization
- Exploring the role of graph spectra in graph coloring algorithm performance
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Stochastic local search and parameters recommendation: a case study on flowshop problems
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Selecting algorithms for large berth allocation problems
- Generating new test instances by evolving in instance space
- Where the really hard quadratic assignment problems are: the QAP-SAT instances
- Enhanced instance space analysis for the maximum flow problem
- Generation techniques for linear programming instances with controllable properties
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- What makes an optimization problem hard?.
- Determining Whether a Problem Characteristic Affects Heuristic Performance
- A complex-networks view of hard combinatorial search spaces
- Instance spaces for machine learning classification
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
This page was built for publication: Measuring instance difficulty for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762054)
