The following pages link to Applied simulated annealing (Q1309041):
Displaying 36 items.
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Optimization of energy confinement in the \(1/\nu \) regime for stellarators (Q939483) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Containment of a single polygon using mathematical programming (Q1268270) (← links)
- General local search methods (Q1268283) (← links)
- Simulated annealing with time-dependent energy function via Sobolev inequalities (Q1272167) (← links)
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism (Q1307811) (← links)
- Planning of high school examinations in Denmark (Q1390323) (← links)
- Surrogate time series. (Q1583829) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
- Optimized planning of frequency hopping in cellular networks (Q1886738) (← links)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Measuring differences between phenomenological growth models applied to epidemiology (Q2240256) (← links)
- Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
- An information-theoretic framework for the lossy compression of link streams (Q2285125) (← links)
- A computational approach to enhancing course timetabling with integer programming (Q2369205) (← links)
- The geometry of nesting problems: a tutorial (Q2384608) (← links)
- Controlling mixed-model assembly lines in real-time by using distributed systems (Q2569076) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Optimization of Internet Protocol network design and routing (Q4446916) (← links)
- A COMPARATIVE STUDY OF MODEL SELECTION METHODS FOR NONLINEAR TIME SERIES (Q4655619) (← links)
- Communication throughput of interconnection networks (Q5096871) (← links)
- Cylinder packing by simulated annealing (Q5189102) (← links)
- Implementation of a university course and examination timetabling system (Q5932035) (← links)
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)
