Pages that link to "Item:Q2482105"
From MaRDI portal
The following pages link to On the asymmetric representatives formulation for the vertex coloring problem (Q2482105):
Displayed 11 items.
- Fractional programming formulation for the vertex coloring problem (Q402376) (← 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)
- 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)
- 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)