Pages that link to "Item:Q3978838"

The following pages link to Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning (Q3978838):

Displayed 50 items.

• Routing and wavelength assignment by partition colouring (Q819072) ‎ (← links)
• A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks (Q859942) ‎ (← links)
• An effective hybrid algorithm for university course timetabling (Q880559) ‎ (← links)
• A cooperative search method for the \(k\)-coloring problem (Q928692) ‎ (← links)
• Long-term staffing based on qualification profiles (Q1006561) ‎ (← links)
• A fuzzy clustering method of construction of ontology-based user profiles (Q1025363) ‎ (← links)
• Combinatorial optimization in system configuration design (Q1027725) ‎ (← links)
• Graph coloring by multiagent fusion search (Q1037448) ‎ (← links)
• Heuristics and exact methods for number partitioning (Q1038378) ‎ (← links)
• Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) ‎ (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) ‎ (← links)
• A memetic algorithm for graph coloring (Q1043356) ‎ (← links)
• Autocorrelation coefficient for the graph bipartitioning problem (Q1127331) ‎ (← links)
• COSINE: A new graph coloring algorithm (Q1180823) ‎ (← links)
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) ‎ (← links)
• An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) ‎ (← links)
• General local search methods (Q1268283) ‎ (← links)
• The life span method -- a new variant of local search (Q1275844) ‎ (← links)
• Path optimization for graph partitioning problems (Q1276954) ‎ (← links)
• A complete anytime algorithm for number partitioning (Q1277696) ‎ (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) ‎ (← links)
• A new tabu search procedure for an audit-scheduling problem (Q1297694) ‎ (← links)
• Local optima topology for the \(k\)-coloring problem (Q1327233) ‎ (← links)
• The hardest constraint problems: A double phase transition (Q1337687) ‎ (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) ‎ (← links)
• Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) ‎ (← links)
• Simulated annealing and tabu search: Lessons from a line search (Q1342098) ‎ (← links)
• Applying tabu search with influential diversification to multiprocessor scheduling (Q1342105) ‎ (← links)
• Exploiting the deep structure of constraint problems (Q1342216) ‎ (← links)
• A comparison of \(p\)-dispersion heuristics (Q1342949) ‎ (← links)
• Constructing efficient simulated annealing algorithms (Q1364480) ‎ (← links)
• Unit disk graph recognition is NP-hard (Q1384186) ‎ (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) ‎ (← links)
• Simulated annealing for manufacturing systems layout design (Q1388923) ‎ (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) ‎ (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) ‎ (← links)
• A robust simulated annealing based examination timetabling system. (Q1406667) ‎ (← links)
• A variable neighborhood search for graph coloring. (Q1410622) ‎ (← links)
• A Lagrangian reconstruction of GENET (Q1589464) ‎ (← links)
• Compiling constraint satisfaction problems (Q1606322) ‎ (← links)
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) ‎ (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) ‎ (← links)
• Constraint satisfaction problems: Algorithms and applications (Q1809839) ‎ (← links)
• Determination of optimal path under approach and exit constraints (Q1847171) ‎ (← links)
• An information-based neural approach to generic constraint satisfaction. (Q1852859) ‎ (← links)
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) ‎ (← links)
• Efficient heuristics for robot acquisition planning for a CIM system (Q1908995) ‎ (← links)
• A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) ‎ (← links)
• Easily searched encodings for number partitioning (Q1918002) ‎ (← links)
• Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) ‎ (← links)