The following pages link to Optimization by Simulated Annealing (Q82025):
Displaying 50 items.
- Some results on the spatial breakdown point of robust point estimates of the variogram (Q1035754) (← links)
- Coupled aerostructural design optimization using the Kriging model and integrated multiobjective optimization algorithm (Q1035939) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Vendor managed inventory for environments with stochastic product usage (Q1040988) (← links)
- Solving a manpower scheduling problem for airline catering using metaheuristics (Q1041027) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Learning in noise: dynamic decision-making in a variable environment (Q1042316) (← links)
- Simplex based space filling designs (Q1044050) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- A simulated annealing technique for multi-objective simulation optimization (Q1049315) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Decreasing energy functions as a tool for studying threshold networks (Q1071738) (← links)
- The complexity of analog computation (Q1077163) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Probabilistic exchange algorithms and Euclidean traveling salesman problems (Q1079126) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach (Q1080365) (← links)
- Experimentation in optimization (Q1084342) (← links)
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization (Q1086259) (← links)
- Generating quasi-random sequences from semi-random sources (Q1088641) (← links)
- Simultaneous identification of linear systems: A heuristic approach (Q1091992) (← links)
- Classification by ordering a (sparse) matrix: A ``simulated annealing'' approach (Q1098521) (← links)
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank (Q1098576) (← links)
- Parsimonious phylogenetic trees in metric spaces and simulated annealing (Q1099115) (← links)
- Mean square rates of convergence in the continuous time simulated annealing algorithm on \({\mathbb{R}}^ d\) (Q1099503) (← links)
- On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
- Mapping DNA by stochastic relaxation (Q1099802) (← links)
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem (Q1101043) (← links)
- Nonstationary Markov chains and convergence of the annealing algorithm (Q1101782) (← links)
- Simulated annealing via Sobolev inequalities (Q1102047) (← links)
- Simulated annealing with noisy or imprecise energy measurements (Q1106726) (← links)
- Random tunneling by means of acceptance-rejection sampling for global optimization (Q1106731) (← links)
- Applications of coding theory to the design of somatic cell hybrid panels (Q1108959) (← links)
- How easy is local search? (Q1109573) (← links)
- Solution of placement and routing problems in telephone exchange unit designs (Q1109671) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- Floorplan design of VLSI circuits (Q1113879) (← links)
- Instantons in stochastic quantisation (Q1116565) (← links)
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing (Q1117236) (← links)
- A randomised 3-colouring algorithm (Q1117242) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- Boltzmann machines for travelling salesman problems (Q1119182) (← links)
- A parallel global optimization algorithm inspired by quantum physics (Q1123550) (← links)
- An application of neurofuzzy modeling: The vehicle assignment problem (Q1124706) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- A comparison of stochastic scheduling rules for maximizing project net present value (Q1127130) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
