Pages that link to "Item:Q752002"

The following pages link to An improved annealing scheme for the QAP (Q752002):

Displaying 50 items.

• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
• Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• The quadratic assignment problem in the context of the printed circuit board assembly process (Q850316) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
• Simulated annealing: A tool for operational research (Q913662) (← links)
• Mapping the convergence of genetic algorithms (Q955480) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• The single-finger keyboard layout problem (Q1025249) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
• An algorithm for quadratic assignment problems (Q1130047) (← links)
• Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
• Simulated annealing applied to the process allocation problem (Q1199515) (← links)
• Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism (Q1307811) (← links)
• Some experiments with simulated annealing techniques for packing problems (Q1309920) (← links)
• Simulated annealing procedures for forming machine cells in group technology (Q1333513) (← links)
• Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
• An analysis of parallel heuristics for task allocation in multicomputers (Q1377284) (← links)
• Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
• A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
• Solving multi objective facility layout problem by modified simulated annealing (Q1643306) (← links)
• Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands (Q1683154) (← links)
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Formulating and solving production planning problems (Q1806882) (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
• Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
• Review on nature-inspired algorithms (Q1981936) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
• Iterated local search for the quadratic assignment problem (Q2503224) (← links)
• A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure (Q2563875) (← links)