A practical mixedinteger programming model for the vertex separation number problem
Mallach, Sven
(2015)
A practical mixedinteger programming model for
the vertex separation number problem.
Working Paper
, 8 p.
Abstract
We present a novel mixedinteger programming formulation for the vertex separation number problem in general directed graphs. The model is conceptually simple and, to the best of our knowledge, much more compact than existing ones. First experiments give hope that it can solve larger instances than has been possible so far if it is combined with preprocessing techniques to reduce the search space.
Actions:
Download: 
PDF
Download (245kB) 

Export as:  [error in script] 
Editorial actions:  View Item (Login required) 
Content information:
Item Type:  Paper (Working Paper) 

Citations:  [error in script] [error in script] 
Subjects: 

Subjects:  05XX Combinatorics > 05Cxx Graph theory > 05C20 Directed graphs (digraphs), tournaments 05XX Combinatorics > 05Cxx Graph theory 68XX Computer science > 68Rxx Discrete mathematics in relation to computer science > 68R10 Graph theory 90XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C11 Mixed integer programming 
Divisions:  Institute of Computer Science > Computer Science Department  Prof. Dr. Juenger 
Depositing User:  Sven Mallach 
Date Deposited:  16 Oct 2015 08:24 
Last Modified:  08 Apr 2016 08:29 
Deposit Information:
ZAIK Number:  [error in script] 

Depositing User:  Sven Mallach 
Date Deposited:  16 Oct 2015 08:24 
Last Modified:  08 Apr 2016 08:29 
URI:  http://earchive.informatik.unikoeln.de/id/eprint/889 