Pages that link to "Item:Q3002686"

The following pages link to A survey on vertex coloring problems (Q3002686):

Displaying 50 items.

• A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
• Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
• A matching pursuit approach to solenoidal filtering of three-dimensional velocity measurements (Q348912) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
• Regular inference as vertex coloring (Q465248) (← links)
• Bounds on spectrum graph coloring (Q510538) (← links)
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• A simple branching scheme for vertex coloring problems (Q765355) (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
• Graph multi-coloring for a job scheduling application (Q1686066) (← links)
• ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
• Optimization by ant algorithms: possible roles for an individual ant (Q1758036) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• Uncertain vertex coloring problem (Q2001167) (← links)
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
• Improving lower bounds for equitable chromatic number (Q2147053) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
• A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• Relaxing the assumptions of knockoffs by conditioning (Q2215771) (← links)
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
• Dominated colorings of graphs (Q2345536) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
• On properly ordered coloring of vertices in a vertex-weighted graph (Q2665834) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
• Practical Implementation of a Quantum Backtracking Algorithm (Q3297790) (← links)
• Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items (Q4596164) (← links)