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

2016 ◽  
Vol 99 (113) ◽  
pp. 99-108
Author(s):  
Zoran Maksimovic
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Maximum Degree ◽  
Mixed Integer ◽  
Connected Subgraph ◽  
Programming Formulation ◽  
Reasonable Time ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation

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.

Mixed Integer Linear Programming Formulation for Aiding Planning Activities in a Complex Pipeline Network

2012 ◽  
Vol 51 (35) ◽  
pp. 11417-11433 ◽  
Author(s):  
Sergio L. Stebel ◽  
Suelen N. B. Magatão ◽  
Lucia V. R. Arruda ◽  
Flávio Neves-Jr. ◽  
Ana P. F. D. Povoa ◽  
...  
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Mixed Integer ◽  
Programming Formulation ◽  
Pipeline Network ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation
Sign in / Sign up

Export Citation Format

Share Document