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 41 items.
- 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)
- Simulated annealing and graph colouring (Q2722656) (← 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)
- (Q3307578) (← links)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning (Q3476605) (← 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)
- GLOBAL CONFORMATION OPTIMIZATION OF MIXED CLUSTERS USING A GENETIC ALGORITHM (Q5715610) (← links)
- On the chromatic number of graphs (Q5942344) (← links)
- The noising methods: A generalization of some metaheuristics (Q5954829) (← links)
- A physicist's approach to number partitioning (Q5958802) (← links)
- (Q6160407) (← links)
- Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677) (← links)
- Parallel heuristic search -- introductions and a new approach (Q6560213) (← links)
- Source detection on graphs (Q6640145) (← links)
