Work

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

Year: 2016

Type: report

Abstract: 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.

Source: HAL

Author: Coudert, David

Institutions: Université Côte d'Azur, COATI: Combinatoire, Optimisation et Algorithmes pour les Télécommunications

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2289100927

Cites: 18

Cited by: 10

Related to: 10