A mixed integer linear programming formulation of closed loop layout with exact distances

2013 ◽  
Vol 30 (3) ◽  
pp. 190-201 ◽  
Author(s):  
Sadegh Niroomand ◽  
Béla Vizvári
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Closed Loop ◽  
Mixed Integer ◽  
Programming Formulation ◽  
Loop Layout ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation

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.

Sign in / Sign up

Export Citation Format

Share Document