The following pages link to Optimization by Simulated Annealing (Q82025):
Displaying 50 items.
- A direct search algorithm for global optimization (Q1736805) (← links)
- A modified cloud particles differential evolution algorithm for real-parameter optimization (Q1736855) (← links)
- Parallel machine scheduling with time constraints on machine qualifications (Q1738819) (← links)
- Sequentially adaptive Bayesian learning algorithms for inference and optimization (Q1740339) (← links)
- A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders (Q1741144) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Effect of exit placement on evacuation plans (Q1750492) (← links)
- An efficient solution method to design the cost-minimizing platform portfolio (Q1751801) (← links)
- Sequencing of picking orders in mobile rack warehouses (Q1751810) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
- The ABC of simulation estimation with auxiliary statistics (Q1754514) (← links)
- Learning shape metrics with Monte Carlo optimization (Q1757360) (← links)
- Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach (Q1758065) (← links)
- Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing (Q1761211) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm (Q1761699) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling (Q1761907) (← links)
- Simulated annealing for optimal ship routing (Q1762005) (← links)
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Computational advances for and from Bayesian analysis (Q1766319) (← links)
- Computational discovery of gene regulatory binding motifs: a Bayesian perspective (Q1766324) (← links)
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683) (← links)
- Simplex sliding mode control for nonlinear uncertain systems via chaos optimization (Q1771662) (← links)
- The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
- Hybrid heuristics for examination timetabling problem (Q1774877) (← links)
- Generalized extremal optimization: an application in heat pipe design (Q1776690) (← links)
- The over-constrained airport gate assignment problem (Q1777160) (← 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)
- Navigation in spatial networks: a survey (Q1782452) (← links)
- Simulated annealing algorithm for optimal capital growth (Q1782909) (← links)
- A two-layer team-assembly model for invention networks (Q1783142) (← links)
- Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils (Q1783477) (← links)
- Distributed Gauss-Newton optimization method for history matching problems with multiple best matches (Q1785159) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Solving routing problems with pairwise synchronization constraints (Q1787918) (← links)
- Understanding cyclical thrombocytopenia: a mathematical modeling approach (Q1788652) (← links)
- Two-echelon location routing synchronized with production schedules and time windows (Q1788921) (← links)
