Pages that link to "Item:Q2467348"

The following pages link to A cutting plane algorithm for graph coloring (Q2467348):

Displaying 36 items.

• Integer programming techniques for the nurse rostering problem (Q284423) (← links)
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Three new upper bounds on the chromatic number (Q765327) (← links)
• Integer linear programming formulations of the filter partitioning minimization problem (Q782755) (← links)
• A cutting plane algorithm for MV portfolio selection model (Q1036539) (← links)
• Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← 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)
• Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• Graph coloring with decision diagrams (Q2118148) (← links)
• A branch and price algorithm for list coloring problem (Q2132397) (← links)
• Improving lower bounds for equitable chromatic number (Q2147053) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
• Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
• Graph coloring inequalities from all-different systems (Q2342600) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
• Polyhedral results for the Equitable Coloring Problem (Q2840701) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
• CsegGraph: a graph colouring instance generator (Q3643182) (← links)
• A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
• A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
• Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)