Measuring instance difficulty for combinatorial optimization problems (Q1762054): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/cor/Smith-MilesL12, #quickstatements; #temporary_batch_1731543907597
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAUSS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Paramils / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967715425 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62033372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the testable graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of NP-complete problems in terms of their correlation coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large quadratic assignment problems on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing and reporting on computational experiments with heuristic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2004: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hard knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem structure heuristics and scaling behavior for genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring with adaptive evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning dynamic algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution of open bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TSP phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of the vertex-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Transitions in Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing heuristics: We have it all wrong / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective function features providing barriers to rapid global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Applicable Synthetic Instances for Branch Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes an optimization problem hard?. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cheeger Constant and Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cuts leaving components of order at least \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GAUSS: an online algorithm selection system for numerical quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes, operators and heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthetic Optimization Problem Generation: Show Us the Correlations! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of an Algorithm for Best Tchebycheff Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of metrics on permutations for search landscape analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering the suitability of optimisation algorithms by learning from evolved instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The landscape of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Reformulations in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: PYTHIA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of complexity transitions on the asymmetric traveling salesman problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/Smith-MilesL12 / rank
 
Normal rank

Latest revision as of 01:38, 14 November 2024

scientific article
Language Label Description Also known as
English
Measuring instance difficulty for combinatorial optimization problems
scientific article

    Statements

    Measuring instance difficulty for combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    algorithm selection
    0 references
    combinatorial optimization
    0 references
    hardness prediction
    0 references
    instance difficulty
    0 references
    landscape analysis
    0 references
    phase transition
    0 references
    traveling salesman problem
    0 references
    assignment problem
    0 references
    knapsack problem
    0 references
    bin-packing
    0 references
    graph coloring
    0 references
    timetabling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers