Geodesic
A New Mixed Integer Linear Programming Formulation for the Maximum Degree Bounded Connected Subgraph Problem
Publications de l'Institut Mathématique, _N_S_99 (2016) no. 113, p. 99 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

In this paper is given 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 then before in a reasonable time.
DOI : 10.2298/PIM1613099M
Classification : 90C11, 90C27
Keywords: integer linear programming, degree-constrained subgraph, combinatorial optimization 
@article{10_2298_PIM1613099M,
     author = {Zoran Maksimovi\'c},
     title = {A {New} {Mixed} {Integer} {Linear} {Programming} {Formulation} for the {Maximum} {Degree} {Bounded} {Connected} {Subgraph} {Problem}},
     journal = {Publications de l'Institut Math\'ematique},
     pages = {99 },
     publisher = {mathdoc},
     volume = {_N_S_99},
     number = {113},
     year = {2016},
     doi = {10.2298/PIM1613099M},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/PIM1613099M/}
}
TY  - JOUR
AU  - Zoran Maksimović
TI  - A New Mixed Integer Linear Programming Formulation for the Maximum Degree Bounded Connected Subgraph Problem
JO  - Publications de l'Institut Mathématique
PY  - 2016
SP  - 99 
VL  - _N_S_99
IS  - 113
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.2298/PIM1613099M/
DO  - 10.2298/PIM1613099M
LA  - en
ID  - 10_2298_PIM1613099M
ER  - 
%0 Journal Article
%A Zoran Maksimović
%T A New Mixed Integer Linear Programming Formulation for the Maximum Degree Bounded Connected Subgraph Problem
%J Publications de l'Institut Mathématique
%D 2016
%P 99 
%V _N_S_99
%N 113
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.2298/PIM1613099M/
%R 10.2298/PIM1613099M
%G en
%F 10_2298_PIM1613099M
Zoran Maksimović. A New Mixed Integer Linear Programming Formulation for the Maximum Degree Bounded Connected Subgraph Problem. Publications de l'Institut Mathématique, _N_S_99 (2016) no. 113, p. 99 . doi : 10.2298/PIM1613099M. http://geodesic.mathdoc.fr/articles/10.2298/PIM1613099M/

Cité par Sources :