Different Formulations for Solving the HeaviestK-Subgraph Problem

DOI10.1080/03155986.2005.11732724OpenAlexW2408452789MaRDI QIDQ6043202

Alain Billionnet

Publication date: 5 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.2005.11732724

zbMATH Keywords

upper boundsexperimentsmixed integer linear programmingheaviest \(k\)-subgraph problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (15)

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints ⋮ A review on algorithms for maximum clique problems ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods ⋮ Quantum solutions for densest \(k\)-subgraph problems ⋮ A polyhedral study of the maximum edge subgraph problem ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ A polyhedral study of the maximum edge subgraph problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method ⋮ Exact and heuristic algorithms for the maximum weighted submatrix coverage problem ⋮ Combinatorial properties and further facets of maximum edge subgraph polytopes ⋮ Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners ⋮ On solving the densestk-subgraph problem on large graphs

This page was built for publication: Different Formulations for Solving the HeaviestK-Subgraph Problem