Pages that link to "Item:Q817187"
From MaRDI portal
The following pages link to An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187):
Displayed 5 items.
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)