Pages that link to "Item:Q3703588"

The following pages link to Convergence of an annealing algorithm (Q3703588):

Displaying 50 items.

• Constructing efficient simulated annealing algorithms (Q1364480) (← links)
• A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
• Convergence rates for annealing diffusion processes (Q1379726) (← links)
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
• A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
• Placement by thermodynamic simulated annealing (Q1409352) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• SSTT: Efficient local search for GSI global routing (Q1412147) (← links)
• Optimal exact experimental designs with correlated errors through a simulated annealing algorithm (Q1606469) (← links)
• Multi-mode resource availability cost problem with recruitment and release dates for resources (Q1634132) (← links)
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
• On the convergence of biogeography-based optimization for binary problems (Q1717756) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
• A theoretical study on the behavior of simulated annealing leading to a new cooling schedule (Q1779535) (← links)
• On the depth of combinatorial optimization problems (Q1801676) (← 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)
• On efficient use of simulated annealing in complex structural optimization problems (Q1811342) (← links)
• Determination of optimal path under approach and exit constraints (Q1847171) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
• Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
• Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules (Q2018645) (← links)
• Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution (Q2125369) (← links)
• Curve approximation by adaptive neighborhood simulated annealing and piecewise Bézier curves (Q2156955) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• Resource constrained project scheduling subject to due dates: preemption permitted with penalty (Q2248711) (← links)
• Stopping and restarting strategy for stochastic sequential search in global optimization (Q2269595) (← links)
• Some notes on concordance between optimization and statistics (Q2298307) (← links)
• The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads (Q2321672) (← links)
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach (Q2368296) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data (Q2433556) (← links)
• Solving the multi-objective nurse scheduling problem with a weighted cost function (Q2468745) (← links)
• \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing (Q2480020) (← links)
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
• A new genetic algorithm (Q2564690) (← links)
• A theoretical framework for simulated annealing (Q2638941) (← links)
• AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS (Q2911573) (← links)
• Non-productive tool path optimisation for four-axis milling using the simulated annealing algorithm (Q2967587) (← links)
• Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload (Q3163289) (← links)
• A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles (Q3533189) (← links)
• (Q3780221) (← links)
• Simulated annealing: An introduction (Q3832323) (← links)
• État de l'art des méthodes “d'optimisation globale” (Q4531458) (← links)
• A COMPARATIVE STUDY OF MODEL SELECTION METHODS FOR NONLINEAR TIME SERIES (Q4655619) (← links)
• Simulated Simulated Annealing (Q4734687) (← links)