An effective modeling and solution approach for the generalized independent set problem
From MaRDI portal
Recommendations
- The generalized independent set problem: polyhedral analysis and solution approaches
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- An unconstrained binary quadratic programming for the maximum independent set problem
- The generalized P‐forest problem on a tree network
- Using critical sets to solve the maximum independent set problem
Cites work
- scientific article; zbMATH DE number 1488074 (Why is no real title available?)
- A new modeling and solution approach for the number partitioning problem
- A unified modeling and solution framework for combinatorial optimization problems
- Adaptive memory tabu search for binary quadratic programs
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Clustering of microarray data via clique partitioning
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Cited in
(7)- Applications and computational advances for solving the QUBO model
- The unconstrained binary quadratic programming problem: a survey
- The generalized vertex cover problem and some variations
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- The generalized independent set problem: polyhedral analysis and solution approaches
- Exact and heuristic solution approaches for the generalized independent set problem
This page was built for publication: An effective modeling and solution approach for the generalized independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458909)