Different formulations for solving the heaviest k-subgraph problem - Archive ouverte HAL Access content directly
Journal Articles INFOR: Information Systems and Operational Research Year : 2005

Different formulations for solving the heaviest k-subgraph problem

Abstract

We consider the heaviest k-subgraph problem (HSP), i.e. determine a block of k nodes of a weighted graph (of n nodes) such that the total edge weight within the subgraph induced by the block is maximized. The aim of the paper is to show what can be expected from mixed-integer linear programming for solving this problem. We compare from a theoretical and practical point of view different MIP formulations of HSP. Computational experiments when the weight of each edge is equal to 1 are reported. They show that the MIP approach is particularly efficient for dense instances.
Not file

Dates and versions

hal-01124973 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01124973 , version 1

Cite

Alain Billionnet. Different formulations for solving the heaviest k-subgraph problem. INFOR: Information Systems and Operational Research , 2005, 43, pp.171-186. ⟨hal-01124973⟩

Collections

CNAM CEDRIC-CNAM
20 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More