Journal ArticleOPEN ACCESS

A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem

Publications de l'Institut Mathematique (2016) 99(113) 99-108
DOI: 10.2298/PIM1613099M
8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We give a new mixed integer linear programming (MILP) formulation for Maximum Degree Bounded Connected Subgraph Problem (MDBCSP). The proposed MILP formulation is the first in literature with polynomial number of constraints. Therefore, it will be possible to solve optimally much more instances before in a reasonable time.

Author supplied keywords

Cite

CITATION STYLE

APA

Maksimović, Z. (2016). A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem. Publications de l’Institut Mathematique, 99(113), 99–108. https://doi.org/10.2298/PIM1613099M

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free