A practical mixed-integer programming model for the vertex separation number problem

Mallach, Sven (2015) A practical mixed-integer programming model for the vertex separation number problem.
Working Paper , 8 p.

Abstract

We present a novel mixed-integer 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: [img] PDF
Download (245kB)
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
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://e-archive.informatik.uni-koeln.de/id/eprint/889