Pages that link to "Item:Q3823079"

The following pages link to Simulated Annealing – An Annotated Bibliography (Q3823079):

Displaying 40 items.

• A survey on optimization metaheuristics (Q497180) (← links)
• Optimization of resource location in hierarchical computer networks (Q583895) (← links)
• Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
• Comparison of the performance of modern heuristics for combinatorial optimization on real data (Q690010) (← links)
• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
• Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions (Q910820) (← links)
• Simulated annealing: A tool for operational research (Q913662) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
• Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
• The afforestation problem: A heuristic method based on simulated annealing (Q1197928) (← links)
• Simulated annealing applied to the process allocation problem (Q1199515) (← links)
• Stochastic techniques for global optimization: A survey of recent advances (Q1200634) (← links)
• On the solving strategy in composite heuristics (Q1200786) (← links)
• The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
• General local search methods (Q1268283) (← links)
• The life span method -- a new variant of local search (Q1275844) (← links)
• Some experiments with simulated annealing techniques for packing problems (Q1309920) (← links)
• Simulated annealing for resource-constrained scheduling (Q1309982) (← links)
• Routeing winter gritting vehicles (Q1317045) (← links)
• Simulated annealing: Practice versus theory (Q1324207) (← links)
• Stochastic annealing for synthesis under uncertainty (Q1388841) (← links)
• A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
• The antennas preassignment problem (Q1766595) (← links)
• Hybrid heuristics for examination timetabling problem (Q1774877) (← links)
• A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
• Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) (← links)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
• Solving the damper placement problem via local search heuristics (Q1908999) (← links)
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
• Improving the mechanical performances of a multilayered plate with the orientations of its layers of fibers (Q2006474) (← links)
• A parallel heuristic for quadratic assignment problems (Q2276872) (← links)
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach (Q2368296) (← links)
• The capacitated centred clustering problem (Q2581607) (← links)
• Heuristic unidirectional flowpath design approaches for automated guided vehicle systems (Q3356027) (← links)
• Simulation optimization: a review of algorithms and applications (Q5919176) (← links)