Pages that link to "Item:Q790720"

The following pages link to Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm (Q790720):

Displaying 50 items.

• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
• Simulated annealing - to cool or not (Q1262289) (← links)
• General local search methods (Q1268283) (← links)
• Determining dominant wind directions (Q1268424) (← links)
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
• Fuzzy rule base learning through simulated annealing (Q1304290) (← links)
• Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (Q1319482) (← links)
• Bin-packing by simulated annealing (Q1324346) (← links)
• Simulated annealing procedures for forming machine cells in group technology (Q1333513) (← links)
• Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
• Stochastic approximation of global minimum points (Q1338378) (← links)
• Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems (Q1339121) (← links)
• Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) (← links)
• DSS for multiobjective project scheduling (Q1342057) (← links)
• Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
• Scaling features in complex optimization problems (Q1359851) (← links)
• Constructing efficient simulated annealing algorithms (Q1364480) (← links)
• Modelling constant weight codes using tabu search (Q1384374) (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
• Simulated annealing for manufacturing systems layout design (Q1388923) (← 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)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
• Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
• Product line selection and pricing under a share-of-surplus choice model. (Q1406498) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• Convergence of the simulated annealing algorithm for continuous global optimization (Q1573995) (← links)
• Nature's way of optimizing (Q1575193) (← links)
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
• Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
• \(P\)-vortices and drama of Gribov copies (Q1591842) (← links)
• Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
• Modeling distributed concept representation in Hopfield neural networks. (Q1596964) (← links)
• Optimal annealing schedules for a modified Tsallis statistics (Q1604442) (← links)
• On the statistical detection of clusters in undirected networks (Q1615145) (← links)
• A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis (Q1623574) (← links)
• Equivalent microstructure problem: mathematical formulation and numerical solution (Q1625050) (← links)
• Solving multifacility Huff location models on networks using metaheuristic and exact approaches (Q1652125) (← links)
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• On selection of statistics for approximate Bayesian computing (or the method of simulated moments) (Q1659104) (← links)
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
• Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands (Q1683154) (← links)
• The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach (Q1720962) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Variants of the AES key schedule for better truncated differential bounds (Q1726661) (← links)
• A modified cloud particles differential evolution algorithm for real-parameter optimization (Q1736855) (← links)
• A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders (Q1741144) (← links)
• Quantile and mean value measures of search process complexity (Q1752630) (← links)
• Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)