Pages that link to "Item:Q2815431"

The following pages link to Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431):

Displaying 30 items.

• Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• A simple branching scheme for vertex coloring problems (Q765355) (← links)
• Constraint programming and operations research (Q1616390) (← 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)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
• Interval scheduling with economies of scale (Q2108158) (← links)
• Graph coloring with decision diagrams (Q2118148) (← links)
• Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← 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)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← 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)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← 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)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
• Branch-and-Cut-and-Price algorithms for the preemptive RCPSP (Q4553884) (← links)
• Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)