The weighted arborescence constraint

DOI10.1007/978-3-319-59776-8_15zbMath1489.68194OpenAlexW2617657508MaRDI QIDQ2011589

Pierre Schaus, Laurence A. Wolsey, Vinasetan Ratheil Houndji, Mahouton Norbert Hounkonnou

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Precedence-constrained arborescences ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ The item dependent stockingcost constraint ⋮ The weighted arborescence constraint

Uses Software

• OscaR
• CP4CAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• An additive bounding procedure for the asymmetric travelling salesman problem
• Cost based filtering for the constrained knapsack problem
• The weighted arborescence constraint
• Solving TSP through the Integration of OR and CP Techniques
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• The Minimum Spanning Tree Constraint
• The Weighted Spanning Tree Constraint Revisited
• The “Not-Too-Heavy Spanning Tree” Constraint
• Finding optimum branchings
• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• On the History of the Minimum Spanning Tree Problem
• Algorithm Theory - SWAT 2004
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• The tree Constraint
• Optimum branchings
• Understanding the Potential of Propagators

This page was built for publication: The weighted arborescence constraint