Pages that link to "Item:Q3057147"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for partition coloring (Q3057147):
Displaying 15 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
