The Weighted Arborescence Constraint

For a directed graph, a Minimum Weight Arborescence (MWA) rooted at a vertex r is a directed spanning tree rooted at r with the minimum total weight. We define the MinArborescence constraint to solve constrained arborescence problems (CAP) in Constraint Programming (CP). A filtering based on the LP reduced costs requires \(O(|V|^2)\) where |V| is the number of vertices. We propose a procedure to strengthen the quality of the LP reduced costs in some cases, also running in \(O(|V|^2)\). Computational results on a variant of CAP show that the additional filtering provided by the constraint reduces the size of the search tree substantially.

[1]  Xavier Lorca.  Contraintes de Partitionnement de Graphe , 2007 .

[2]  Daniele Vigo,et al.  Solving TSP through the Integration of OR and CP Techniques , 1999, Electron. Notes Discret. Math..

[3]  Matteo Fischetti,et al.  A branch‐and‐cut algorithm for the resource‐constrained minimum‐weight arborescence problem , 1997 .

[4]  Louis-Martin Rousseau,et al.  The Weighted Spanning Tree Constraint Revisited , 2010, CPAIOR.

[5]  Xavier Lorca,et al.  The tree Constraint , 2005, CPAIOR.

[6]  Pierre Schaus,et al.  Understanding the Potential of Propagators , 2015, CPAIOR.

[7]  Matteo Fischetti,et al.  An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs , 1993, INFORMS J. Comput..

[8]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

[9]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[10]  Matteo Fischetti,et al.  A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem , 1997, Networks.

[11]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[12]  Fritz Bock.  An algorithm to construct a minimum directed spanning tree in a directed network , 1971 .

[13]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[14]  Meinolf Sellmann,et al.  Cost Based Filtering for the Constrained Knapsack Problem , 2002, Ann. Oper. Res..

[15]  Jean-Guillaume Fages,et al.  Revisiting the tree Constraint , 2011, CP.

[16]  Jean-Charles Régin,et al.  Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint , 2008, CPAIOR.

[17]  Irit Katriel,et al.  The Minimum Spanning Tree Constraint , 2006, CP.

[18]  Monique Guignard-Spielberg,et al.  An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem , 1990, Networks.

[19]  Irit Katriel,et al.  The "Not-Too-Heavy Spanning Tree" Constraint , 2007, CPAIOR.

[20]  Mikkel Thorup,et al.  Melding priority queues , 2004, TALG.

[21]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.