Pages that link to "Item:Q1649282"
From MaRDI portal
The following pages link to A new heuristic algorithm to solve the maximum independent set problem (Q1649282):
Displaying 15 items.
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
- An independent set approach for the communication network of the GPS III system (Q1941383) (← links)
- A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
- New instances for maximum weight independent set from a vehicle routing application (Q2241318) (← links)
- Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
- Heuristic algorithm for finding the maximum independent set (Q2452735) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- New properties of maximum independent set problem solution truncation rules or redundant branches (Q2737186) (← links)
- An elitist genetic algorithm for the maximum independent set problem. (Q2768237) (← links)
- A simple algorithm to optimize maximum (Q2792975) (← links)
- An unconstrained binary quadratic programming for the maximum independent set problem (Q2870792) (← links)
- A branch-and-price approach for the maximum weight independent set problem (Q5717716) (← links)
