Pages that link to "Item:Q3798159"
From MaRDI portal
The following pages link to Cooling Schedules for Optimal Annealing (Q3798159):
Displayed 50 items.
- Simulated annealing and tabu search: Lessons from a line search (Q1342098) (← links)
- The depth and width of local minima in discrete solution spaces (Q1343158) (← links)
- On discrete inhomogeneous exit problems (Q1354835) (← links)
- Stochastic simulations of two-dimensional composite packings (Q1372030) (← links)
- On the invariant measure of non-reversible simulated annealing (Q1382243) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
- Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing (Q1404632) (← links)
- A robust simulated annealing based examination timetabling system. (Q1406667) (← links)
- Placement by thermodynamic simulated annealing (Q1409352) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- The loop erased exit path and the metastability of a biased vote process (Q1411887) (← links)
- Convergence of the simulated annealing algorithm for continuous global optimization (Q1573995) (← links)
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules (Q1578669) (← links)
- Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory (Q1596932) (← links)
- On the convergence of generalized hill climbing algorithms (Q1602702) (← links)
- ACO algorithms with guaranteed convergence to the optimal solution (Q1603542) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- Proposals for chunking and tabu search (Q1609920) (← links)
- Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem (Q1777596) (← links)
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule (Q1779535) (← links)
- Solution quality of random search methods for discrete stochastic optimization (Q1780464) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- Solving the medium newspaper production/distribution problem (Q1809799) (← links)
- Analysis of static simulated annealing algorithms (Q1810929) (← links)
- A study of subadmissible simulated annealing algorithms (Q1814965) (← links)
- Global optimization with exploration/selection algorithms and simulated annealing (Q1872426) (← links)
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systems (Q1885946) (← links)
- Adaptive temperature control for simulated annealing: a comparative study (Q1886508) (← links)
- Remarks on the ergodicity of simulated annealing algorithms on a graph (Q1899273) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Limited communication control (Q1960457) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- Simulated annealing algorithms for continuous global optimization: Convergence conditions (Q1973485) (← links)
- Stopping and restarting strategy for stochastic sequential search in global optimization (Q2269595) (← links)
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms (Q2366994) (← links)
- Multi-way graph partition by stochastic probe (Q2367052) (← links)
- Optimal parameters for search using a barrier tree Markov model (Q2455598) (← links)
- Lévy flights, non-local search and simulated annealing (Q2458594) (← links)
- An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
- Optimization of transit route network, vehicle headways and timetables for large-scale transit networks (Q2462175) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Robust estimators and designs for field experiments (Q2474411) (← links)
- Improving inductive logic programming by using simulated annealing (Q2476777) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- Sufficient and necessary condition for the convergence of stochastic approximation algorithms (Q2489838) (← links)