Published February 9, 2016 | Version v1
Report

A note on Integer Linear Programming formulations for linear ordering problems on graphs

Creators

Contributors

Others:

Description

In this paper, we present a new set of constraints for modeling linear ordering problems on graphs using Integer Linear Programming (ILP). These constraints express the membership of a vertex to a prefix rather than the exact position of a vertex in the ordering. We use these constraints to propose new ILP formulations for well-known linear ordering optimization problems, namely the Pathwidth, Cutwidth, Bandwidth, SumCut and Optimal Linear Arrangement problems. Our formulations are not only more compact than previous proposals, but also more efficient as shown by our experimental evaluations on large benchmark instances.

Additional details

Identifiers

URL
https://hal.inria.fr/hal-01271838
URN
urn:oai:HAL:hal-01271838v1