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

Zoran Maksimović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Zoran Maksimović

Publication year - 2016

Publication title -

publications de l institut mathematique

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.246

H-Index - 17

eISSN - 1820-7405

pISSN - 0350-1302

DOI - 10.2298/pim1613099m

Subject(s) - integer programming , bounded function , mathematics , degree (music) , linear programming , mathematical optimization , integer (computer science) , branch and cut , combinatorics , computer science , physics , acoustics , programming language , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research