Pages that link to "Item:Q2359154"
From MaRDI portal
The following pages link to On characterization of maximal independent sets via quadratic optimization (Q2359154):
Displaying 9 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- An unconstrained binary quadratic programming for the maximum independent set problem (Q2870792) (← links)
- The max quasi-independent set Problem (Q3569731) (← links)
- (Q4258251) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)