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.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times (Q324327) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- The multiple team formation problem using sociometry (Q342525) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Determination of initial temperature in fast simulated annealing (Q457220) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Integer linear programming model for multidimensional two-way number partitioning problem (Q623171) (← links)
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- 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)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← 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)