Algorithms for the generalized independent set problem based on a quadratic optimization approach

DOI10.1007/S11590-019-01418-9MaRDI QIDQ2329644zbMATH OpenOpenAlexFDO

Authors Seyedmohammadhossein Hosseinian, Sergiy Butenko

Publication date 18 October 2019

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-019-01418-9

zbMATH Keywords

combinatorial branch-and-boundconstruction heuristicgeneralized independent set problemquadratic optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
• The generalized independent set problem: polyhedral analysis and solution approaches
• An effective modeling and solution approach for the generalized independent set problem
• An unconstrained binary quadratic programming for the maximum independent set problem
• A new heuristic algorithm to solve the maximum independent set problem

Cites work

• A nonconvex quadratic optimization approach to the maximum edge weight clique problem
• An effective modeling and solution approach for the generalized independent set problem
• An exact algorithm for the maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• Finding a maximal weighted independent set in wireless networks
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Introduction to stochastic programming.
• Linear and nonlinear programming.
• Message Passing for Maximum Weight Independent Set
• On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• The generalized independent set problem: polyhedral analysis and solution approaches

Cited in

(6)

• A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
• The generalized independent set problem: polyhedral analysis and solution approaches
• Polyhedral properties of the induced cluster subgraphs
• A neurodynamic approach to zero-one quadratic programming
• An effective modeling and solution approach for the generalized independent set problem
• Exact and heuristic solution approaches for the generalized independent set problem

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Algorithms for the generalized independent set problem based on a quadratic optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329644)