Pages that link to "Item:Q402376"
From MaRDI portal
The following pages link to Fractional programming formulation for the vertex coloring problem (Q402376):
Displaying 7 items.
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← 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 distance polytope for the vertex coloring problem (Q1661874) (← links)
- Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)