The following pages link to Optimization by Simulated Annealing (Q82025):
Displaying 50 items.
- Algorithms for approximate graph matching (Q1357079) (← links)
- Chaos and asymptotical stability in discrete-time neural networks (Q1359349) (← links)
- Scaling features in complex optimization problems (Q1359851) (← links)
- Machining condition optimization by genetic algorithms and simulated annealing (Q1362972) (← links)
- Constructing efficient simulated annealing algorithms (Q1364480) (← links)
- A simulated annealing based algorithm for eigenvalue problems (Q1366254) (← links)
- A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion (Q1371918) (← links)
- Stochastic simulations of two-dimensional composite packings (Q1372030) (← links)
- The general lotsizing and scheduling problem (Q1374405) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
- The energy transformation method for the Metropolis algorithm compared with simulated annealing (Q1377038) (← links)
- An analysis of parallel heuristics for task allocation in multicomputers (Q1377284) (← links)
- New upper bounds for binary covering codes (Q1377844) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- Modelling constant weight codes using tabu search (Q1384374) (← links)
- Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- Stochastic annealing for synthesis under uncertainty (Q1388841) (← links)
- Simulated annealing for manufacturing systems layout design (Q1388923) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations (Q1390207) (← links)
- A double annealing algorithm for discrete location/allocation problems (Q1390233) (← links)
- Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms (Q1390245) (← links)
- A model for designing callable bonds and its solution using tabu search (Q1391445) (← links)
- The TSP phase transition (Q1391912) (← links)
- Developments in structural-acoustic optimization for passive noise control (Q1396234) (← links)
- Tutorial on maximum likelihood estimation (Q1398364) (← links)
- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. (Q1399501) (← links)
- Computational abilities of a chaotic neural network (Q1401524) (← links)
- Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing (Q1404632) (← links)
- Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
- Product line selection and pricing under a share-of-surplus choice model. (Q1406498) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
- A local search template. (Q1406708) (← links)
- Hysteretic optimization for the traveling salesman problem (Q1409111) (← links)
- Placement by thermodynamic simulated annealing (Q1409352) (← links)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- A simulated annealing approach for manufacturing cell formation with multiple identical machines. (Q1410629) (← links)
- SSTT: Efficient local search for GSI global routing (Q1412147) (← links)
- A direct stochastic algorithm for global search (Q1412565) (← links)
- Improved algorithm for geometry optimisation using damped molecular dynamics (Q1413123) (← links)
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities. (Q1418590) (← links)
- FACOPT: A user friendly FACility layout OPTimization system. (Q1422356) (← links)
- Locating service facilities whose reliability is distance dependent. (Q1422360) (← links)
