New methods to color the vertices of a graph
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Combinatorial optimization in system configuration design
- Graph coloring by multiagent fusion search
- Models and heuristic algorithms for a weighted vertex coloring problem
- A search space ``cartography for guiding graph coloring heuristics
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- A memetic algorithm for graph coloring
- Reasoning from last conflict(s) in constraint programming
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Worst case analysis of a graph coloring algorithm
- Numerical experiences with graph coloring algorithms
- Chromatic optimisation: Limitations, objectives, uses, references
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Heuristic for rapidly four-coloring large planar graphs
- COSINE: A new graph coloring algorithm
- Weighted graphs and university course timetabling
- Nested annealing: A provable improvement to simulated annealing
- A logic approach to the resolution of constraints in timetabling
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- An algorithm for finding a maximum clique in a graph
- A fast algorithm for the maximum weight clique problem
- The maximum clique problem
- Chromatic scheduling and frequency assignment
- An exact algorithm for the maximum stable set problem
- Hard-to-color graphs for connected sequential colorings
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Planning of high school examinations in Denmark
- A variable neighborhood search for graph coloring.
- Backtracking algorithms for disjunctions of temporal constraints
- Recent research directions in automated timetabling
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- A cellular memetic algorithm for the examination timetabling problem
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Strong valid inequalities for Boolean logical pattern generation
- Graph multi-coloring for a job scheduling application
- On biconnected and fragile subgraphs of low diameter
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping
- Decomposing clique search problems into smaller instances based on node and edge colorings
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A harmony search algorithm for university course timetabling
- Linear combinations of heuristics for examination timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Heuristics and lower bounds for the bin packing problem with conflicts
- Constraint solving for proof planning
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- An information-based neural approach to generic constraint satisfaction.
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Genetic and hybrid algorithms for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Weighted improper colouring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Accelerating backtrack search with a best-first-search strategy
- Privacy-preserving data splitting: a combinatorial approach
- An incremental search heuristic for coloring vertices of a graph
- The variational quantum eigensolver: a review of methods and best practices
- Graph coloring with decision diagrams
- A branch and price algorithm for list coloring problem
- Eigen-stratified models
- Variable ordering for decision diagrams: a portfolio approach
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- On Monte Carlo tree search for weighted vertex coloring
- An exact algorithm for the edge coloring by total labeling problem
- Vertex coloring of a graph for memory constrained scenarios
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- A new vertex coloring heuristic and corresponding chromatic number
- Fast tensor product Schwarz smoothers for high-order discontinuous Galerkin methods
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Estimating clique size by coloring the nodes of auxiliary graphs
- Pickup and delivery problem with incompatibility constraints
- On the use of some known methods for \(T\)-colorings of graphs
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Adaptive tabu search for course timetabling
- Simple decentralized graph coloring
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- An exact algorithm for parallel machine scheduling with conflicts
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- A graph-based hyper-heuristic for educational timetabling problems
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- The general \(\alpha \)-decomposition problem of fuzzy relations
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Generalised graph colouring by a hybrid of local search and constraint programming
- A cutting plane algorithm for graph coloring
- A semidefinite programming-based heuristic for graph coloring
- An ant-based algorithm for coloring graphs
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Constructive generation of very hard 3-colorability instances
- An adaptive memory algorithm for the k-coloring problem
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
This page was built for publication: New methods to color the vertices of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175306)
