A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A note on some computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set partitioning heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the generalised assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for computing an operational timetable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for a difficult single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for large scale timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving hard set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00294-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037361138 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
A tabu search approach to the constraint satisfaction problem as a general problem solver
scientific article

    Statements

    A tabu search approach to the constraint satisfaction problem as a general problem solver (English)
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    combinatorial problems
    0 references
    constraint satisfaction problem (CSP)
    0 references
    meta-heuristics
    0 references
    tabu search
    0 references
    general problem solver
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references