Nature's way of optimizing

DOI10.1016/S0004-3702(00)00007-2zbMath0949.90075arXivcond-mat/9901351OpenAlexW2170123469WikidataQ62599736 ScholiaQ62599736MaRDI QIDQ1575193

Allon G. Percus, Stefan Boettcher

Publication date: 21 August 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9901351

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchtraveling salesman problemgraph partitioningself-organized criticality

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Population extremal optimization-based extended distributed model predictive load frequency control of multi-area interconnected power systems, Design of PID controller based on a self-adaptive state-space predictive functional control using extremal optimization method, An emergent computation approach to the problem of polygon layout with performance constraints, Studies on controllability of directed networks with extremal optimization, Memetic algorithms-based neural network learning for basic oxygen furnace endpoint prediction, The mean field traveling salesman and related problems, Replica symmetry of the minimum matching, NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL, An improved real-coded population-based extremal optimization method for continuous unconstrained optimization problems, Multiobjective extremal optimization with applications to engineering design, Next nearest neighbour Ising models on random graphs, Adaptive extremal optimization by detrended fluctuation analysis, A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization, The computing of the optimal power consumption for semi-track air-cushion vehicle using hybrid generalized extremal optimization, Development of hybrid evolutionary algorithms for production scheduling of hot strip mill, Positive role of glassy dynamics in finite-time optimization by threshold algorithms, Faster Monte Carlo simulations at low temperatures. The waiting time method, The peculiar phase structure of random graph bisection, A HETEROSYNAPTIC LEARNING RULE FOR NEURAL NETWORKS, Large-scale parallelism for constraint-based local search: the costas array case study, Optimization and self-organized criticality in a magnetic system, Spines of random constraint satisfaction problems: definition and connection with computational complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Future paths for integer programming and links to artificial intelligence
• Combining simulated annealing with local search heuristics
• Recent directions in netlist partitioning: a survey
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Genetic algorithm and graph partitioning
• Extremal optimization of graph partitioning at the percolation threshold
• Equation of State Calculations by Fast Computing Machines