Pages that link to "Item:Q2482105"

The following pages link to On the asymmetric representatives formulation for the vertex coloring problem (Q2482105):

Displaying 38 items.

• A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
• Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
• Integer linear programming formulations of the filter partitioning minimization problem (Q782755) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
• Finding the root graph through minimum edge deletion (Q2028798) (← links)
• Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• Conference scheduling: a clustering-based approach (Q2242187) (← 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)
• Memetic collaborative approaches for finding balanced incomplete block designs (Q2337377) (← links)
• The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
• Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
• Polyhedral results for the Equitable Coloring Problem (Q2840701) (← links)
• A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
• Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)