Recommendations
- scientific article; zbMATH DE number 4048925
- scientific article; zbMATH DE number 4085427
- Using simulated annealing to solve routing and location problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Statistical mechanics: a general approach to combinatorial optimization
Cited in
(only showing first 100 items - show all)- Global search algorithm for automated maintenance planning and scheduling of parts requests
- A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
- Minimizing total completion time in two-machine flow shops with exact delays
- Understanding the role of the topology in protein folding by computational inverse folding experiments
- Stochastic protein folding simulation in the three-dimensional HP-model
- A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints
- Long-term staffing based on qualification profiles
- Simulated annealing in the presence of noise
- Approximate solution of a resource-constrained scheduling problem
- Fast image registration by hierarchical soft correspondence detection
- Statistical reconstruction of random point patterns
- Comparison of non-linear optimization algorithms for yield curve estimation
- Allocation search methods for a generalized class of location-allocation problems
- Point-to-point trajectory planning of wheeled mobile manipulators with stability constraint. Extension of the random-profile approach
- Revisiting constraint-directed search
- Review of utilization of genetic algorithms in heat transfer problems
- Modeling endotoxin-induced systemic inflammation using an indirect response approach
- It's about time: signal recognition in staged models of protein translocation
- First-order design of geodetic networks using the simulated annealing method
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
- Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
- A new family of life distributions for dependent data: estimation
- GSA-based maximum likelihood estimation for threshold vector error correction model
- A framework for multi-robot node coverage in sensor networks
- Single-commodity vehicle routing problem with pickup and delivery service
- A survey on metaheuristics for stochastic combinatorial optimization
- The single-finger keyboard layout problem
- A fuzzy clustering method of construction of ontology-based user profiles
- Hybrid parallel tempering and simulated annealing method
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- A robust and efficient algorithm for planar competitive location problems
- Optimal location with equitable loads
- The multiple server center location problem
- Competitive facility location on decentralized supply chains
- The variable radius covering problem
- A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
- Molecular conformation of n-alkanes using terrain/funneling methods
- The interacting-particle algorithm with dynamic heating and cooling
- A tabu search approach for the minimum sum-of-squares clustering problem
- Robust optimization - a comprehensive survey
- Shape optimization of 2D structures using simulated annealing
- Some results on the spatial breakdown point of robust point estimates of the variogram
- Coupled aerostructural design optimization using the Kriging model and integrated multiobjective optimization algorithm
- Exemplar-based clustering via simulated annealing
- A hybrid evolution strategy for the open vehicle routing problem
- Clustering search algorithm for the capacitated centered clustering problem
- Vendor managed inventory for environments with stochastic product usage
- Solving a manpower scheduling problem for airline catering using metaheuristics
- Hybridizing exact methods and metaheuristics: a taxonomy
- Learning in noise: dynamic decision-making in a variable environment
- Simplex based space filling designs
- Heuristics for container loading of furniture
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A simulated annealing technique for multi-objective simulation optimization
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Decreasing energy functions as a tool for studying threshold networks
- The complexity of analog computation
- Randomized algorithms in combinatorial optimization: A survey
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Quadratic functions with exponential number of local maxima
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- Experimentation in optimization
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization
- Generating quasi-random sequences from semi-random sources
- Simultaneous identification of linear systems: A heuristic approach
- Classification by ordering a (sparse) matrix: A ``simulated annealing approach
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- Mean square rates of convergence in the continuous time simulated annealing algorithm on \({\mathbb{R}}^ d\)
- On the convergence of stationary distributions in simulated annealing algorithms
- Mapping DNA by stochastic relaxation
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- Nonstationary Markov chains and convergence of the annealing algorithm
- Simulated annealing via Sobolev inequalities
- Simulated annealing with noisy or imprecise energy measurements
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Applications of coding theory to the design of somatic cell hybrid panels
- How easy is local search?
- Solution of placement and routing problems in telephone exchange unit designs
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Floorplan design of VLSI circuits
- Instantons in stochastic quantisation
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- A randomised 3-colouring algorithm
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Boltzmann machines for travelling salesman problems
- A parallel global optimization algorithm inspired by quantum physics
- An application of neurofuzzy modeling: The vehicle assignment problem
- An application of simulated annealing to the cutting stock problem
- A comparison of stochastic scheduling rules for maximizing project net present value
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- A method of spatial reasoning based on qualitative trigonometry
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- On the identifiability of Bayesian factor analytic models
- Global optimization and simulated annealing
- Bayesian approach to global optimization and application to multiobjective and constrained problems
- On the convergence of ``threshold accepting
- A simulated annealing channel routing algorithm
- Nonlinear dynamics and stability of analog neural networks
This page was built for publication: Optimization by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q82025)
