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):
Displayed 50 items.
- 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)
- An ant-based algorithm for coloring graphs (Q2467354) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- Constraint satisfaction methods for solving the staff transfer problem (Q2476428) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- Randomized methods for the number partitioning problem (Q2563882) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands (Q2629676) (← links)
- Matching formulation of the staff transfer problem: meta-heuristic approaches (Q2656523) (← links)
- Refining the phase transition in combinatorial search (Q2674181) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS (Q4547634) (← links)
- Wavefront cellular learning automata (Q4565913) (← links)
- Optimal Sampling for Simulated Annealing Under Noise (Q5131720) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems (Q5168734) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)