research
oaioai:e-archive.informatik.uni-koeln.de:889

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

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

Similar works

Full text

thumbnail-image

computer science publication server

Provided a free PDF
oaioai:e-archive.informatik.uni-koeln.de:889Last time updated on 12/17/2017View original full text link

This paper was published in computer science publication server.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.