Pages that link to "Item:Q790720"
From MaRDI portal
The following pages link to Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm (Q790720):
Displaying 50 items.
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- An optimization model for minimizing systemic risk (Q829210) (← links)
- Traveling solitary waves for doubly-resonant media: computation via simulated annealing (Q845651) (← links)
- Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems (Q857946) (← links)
- A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks (Q859942) (← links)
- Stochastic local search for the FEATURE SET problem, with applications to microarray data (Q865564) (← links)
- A heuristic for the label printing problem (Q875404) (← links)
- Minimum norm solution of the absolute value equations via simulated annealing algorithm (Q897990) (← links)
- Calibration of GARCH models using concurrent accelerated random search (Q905332) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions (Q910820) (← links)
- Simulated annealing: A tool for operational research (Q913662) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing (Q920478) (← links)
- The physicist's approach to the travelling salesman problem. II (Q920852) (← links)
- The ``molecular'' traveling salesman (Q922393) (← links)
- A probabilistic construction of model validation (Q929050) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- HSAGA and its application for the construction of near-Moore digraphs (Q954960) (← links)
- A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs (Q958805) (← links)
- A dual latent class unfolding model for two-way two-mode preference rating data (Q961773) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation (Q989827) (← links)
- Global search algorithm for automated maintenance planning and scheduling of parts requests (Q1000953) (← links)
- Stochastic protein folding simulation in the three-dimensional HP-model (Q1004918) (← links)
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- Comparison of non-linear optimization algorithms for yield curve estimation (Q1011191) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- A fuzzy clustering method of construction of ontology-based user profiles (Q1025363) (← links)
- A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data (Q1029518) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Probabilistic exchange algorithms and Euclidean traveling salesman problems (Q1079126) (← links)
- On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
- Simulated annealing with noisy or imprecise energy measurements (Q1106726) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- Boltzmann machines for travelling salesman problems (Q1119182) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- A method of spatial reasoning based on qualitative trigonometry (Q1128486) (← links)
- Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
- Trends in systolic and cellular computation (Q1184130) (← links)
- A stochastic probing algorithm for global optimization (Q1187848) (← links)
- Composite stock cutting through simulated annealing (Q1197089) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- The afforestation problem: A heuristic method based on simulated annealing (Q1197928) (← links)
- Stochastic techniques for global optimization: A survey of recent advances (Q1200634) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- A computational procedure for part design (Q1202713) (← links)