Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362833254
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.1996.tb00032.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088162030 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59195779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of neural networks for solving hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB-A quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experience in applying a stochastic method to location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive system for constructing timetables on a PC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification scheme for vehicle routing and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search techniques. A tutorial and an application to neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Convergence Results for Probabilistic Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An additive bounding procedure for the asymmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for heuristic search: A bilateral linkage with artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of symmetric threshold automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-greedy heuristics: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neurons with graded response have collective computational properties like those of two-state neurons. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organization and associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate solutions to NP-hard problems by neural networks is hard / rank
 
Normal rank

Latest revision as of 09:22, 27 May 2024

scientific article; zbMATH DE number 967165
Language Label Description Also known as
English
Heuristics from Nature for Hard Combinatorial Optimization Problems
scientific article; zbMATH DE number 967165

    Statements

    Heuristics from Nature for Hard Combinatorial Optimization Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 1997
    0 references
    single and multiagent search
    0 references
    heuristics
    0 references
    graph optimization
    0 references
    NP-hard combinatorial optimization
    0 references
    genetic algorithms
    0 references
    simulated annealing
    0 references
    sampling
    0 references
    clustering
    0 references
    tabu search
    0 references
    neural nets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers