An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996): Difference between revisions

Latest revision as of 17:19, 17 May 2024

scientific article

Language	Label	Description	Also known as
English	An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search	scientific article

Statements

instance of

scholarly article

0 references

title

An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (English)

0 references

published in

Annals of Operations Research

0 references

publication date

16 August 1993

0 references

author

Pablo Moscato

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A review of combinatorial problems arising in feedforward neural network design

0 references

Q5729634

0 references

Q5202543

0 references

The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm

0 references

The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach

0 references

Threshold phenomena in random structures

0 references

Tabu search techniques. A tutorial and an application to neural networks

0 references

Paths, Trees, and Flowers

0 references

Q4692508

0 references

Using tabu search techniques for graph coloring

0 references

Q4079017

0 references

Q3992882

0 references

Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane

0 references

A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem

0 references

Optimization by Simulated Annealing

0 references

Q5187226

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

0 references

Q4174468

0 references

A deterministic annealing approach to clustering

0 references

An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules

0 references

Tabu Search Applied to the Quadratic Assignment Problem

0 references

Efficient simulated annealing on fractal energy landscapes

0 references

Identifiers

zbMATH Open document ID

0775.90292

0 references

DOI

10.1007/BF02022564

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2366996

@@ Property / cites work @@
+A review of combinatorial problems arising in feedforward neural network design
+Normal rank
@@ Property / cites work @@
+Q5729634
@@ Property / cites work: Q5729634 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5202543
@@ Property / cites work: Q5202543 / rank @@
+Normal rank
@@ Property / cites work @@
+The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
+Normal rank
@@ Property / cites work @@
+The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
+Normal rank
@@ Property / cites work @@
+Threshold phenomena in random structures
@@ Property / cites work: Threshold phenomena in random structures / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search techniques. A tutorial and an application to neural networks
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079017
@@ Property / cites work: Q4079017 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992882
@@ Property / cites work: Q3992882 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+Q4174468
@@ Property / cites work: Q4174468 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic annealing approach to clustering
@@ Property / cites work: A deterministic annealing approach to clustering / rank @@
+Normal rank
@@ Property / cites work @@
+An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
+Normal rank
@@ Property / cites work @@
+Tabu Search Applied to the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Efficient simulated annealing on fractal energy landscapes
+Normal rank