Pages that link to "Item:Q1337127"

The following pages link to Simulated annealing for constrained global optimization (Q1337127):

Displaying 41 items.

• A parallel implementation of an \(O^\ast(n^4)\) volume algorithm (Q302146) (← links)
• The combination of continuous network design and route guidance (Q342420) (← links)
• Inventory models with managerial policy independent of demand (Q418065) (← links)
• Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
• Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
• Evolutionarily stable diffusive dispersal (Q478173) (← links)
• Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays (Q496611) (← links)
• Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
• Parameter identification in dynamic systems using the homotopy optimization approach (Q649540) (← links)
• Matching stochastic algorithms to objective function landscapes (Q813359) (← links)
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
• A randomized approximation algorithm for the minimal-norm static-output-feedback problem (Q901202) (← links)
• Adaptive search with stochastic acceptance probabilities for global optimization (Q943781) (← links)
• A new multiobjective simulated annealing algorithm (Q946343) (← links)
• A local exploration-based differential evolution algorithm for constrained global optimization (Q1004154) (← links)
• New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
• Convergence of the simulated annealing algorithm for continuous global optimization (Q1573995) (← links)
• Recent developments and trends in global optimization (Q1593827) (← links)
• Simulation optimization of risk measures with adaptive risk levels (Q1753134) (← links)
• Towards pure adaptive search (Q1905968) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Sequential Monte Carlo simulated annealing (Q1937969) (← links)
• Simulated annealing algorithms for continuous global optimization: Convergence conditions (Q1973485) (← links)
• A systematic approach for examining the impact of calibration uncertainty in disease modeling (Q1989736) (← links)
• A randomized algorithm for optimal PID controllers (Q2331606) (← links)
• Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming (Q2418162) (← links)
• A flexible sequential Monte Carlo algorithm for parametric constrained regression (Q2419144) (← links)
• A characterization of probabilities with full support and the Laplace method (Q2420792) (← links)
• A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm (Q2445214) (← links)
• Derivative-free filter simulated annealing method for constrained continuous global optimization (Q2457918) (← links)
• An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
• On application of the ray-shooting method for LQR via static-output-feedback (Q2633243) (← links)
• A reduction method for semi-infinite programming by means of a global stochastic approach† (Q3391897) (← links)
• STOCHASTIC MODEL OF LAKE SYSTEM INVASION AND ITS OPTIMAL CONTROL: NEURODYNAMIC PROGRAMMING AS A SOLUTION METHOD (Q3393964) (← links)
• Pure Random Search with exponential rate of convergency (Q3553768) (← links)
• Comparative analysis of the cutting angle and simulated annealing methods in global optimization (Q4467167) (← links)
• Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space (Q5131717) (← links)
• A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130) (← links)
• Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization (Q5198687) (← links)
• Airfreight forwarder's shipment planning: shipment consolidation and containerization (Q6065643) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)