Pages that link to "Item:Q3210915"
From MaRDI portal
The following pages link to An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915):
Displayed 10 items.
- On a posterior evaluation of a simple greedy method for set packing (Q941055) (← links)
- A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
- The maximum clique problem (Q1318271) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)