Pages that link to "Item:Q429677"

The following pages link to An exact approach for the vertex coloring problem (Q429677):

Displaying 50 items.

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
• A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← 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)
• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• A simple branching scheme for vertex coloring problems (Q765355) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• Linear programming formulation of the vertex colouring problem (Q975796) (← links)
• The vertex coloring problem and its generalizations (Q1022440) (← links)
• Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← 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)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← 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)
• Graph coloring with decision diagrams (Q2118148) (← links)
• A branch and price algorithm for list coloring problem (Q2132397) (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• Graph coloring-based approach for railway station design analysis and capacity determination (Q2189952) (← links)
• Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← 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)
• Simple decentralized graph coloring (Q2397096) (← links)
• Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
• An exact method for graph coloring (Q2489282) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
• Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
• Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
• A metaheuristic approach for the vertex coloring problem (Q2901013) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• (Q2970217) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Branch-and-Cut-and-Price algorithms for the preemptive RCPSP (Q4553884) (← links)
• An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)