Pages that link to "Item:Q3978838"
From MaRDI portal
The following pages link to Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning (Q3978838):
Displaying 50 items.
- 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)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891) (← 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)
- Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
- Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
- Problem space local search for number partitioning (Q1919856) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms (Q2366994) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
