The weighted arborescence constraint

DOI10.1007/978-3-319-59776-8_15MaRDI QIDQ2011589zbMATHOpenAlexFDO

Authors Vinasetan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, 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

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

Recommendations

• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• Models and heuristics for a minimum arborescence problem
• Counting minimum weight arborescences
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences

Cites work

• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• scientific article; zbMATH DE number 3373559 (Why is no real title available?)
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• Algorithm Theory - SWAT 2004
• An additive bounding procedure for the asymmetric travelling salesman problem
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• Cost based filtering for the constrained knapsack problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Finding optimum branchings
• Global constraints for tree partitions of graphs
• On the History of the Minimum Spanning Tree Problem
• Optimum branchings
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Solving TSP through the integration of OR and CP techniques
• The Minimum Spanning Tree Constraint
• The Weighted Spanning Tree Constraint Revisited
• The tree Constraint
• The weighted arborescence constraint
• The “Not-Too-Heavy Spanning Tree” Constraint
• Understanding the potential of propagators

Cited in

(11)

• Precedence-constrained arborescences
• Minimum \(k\) arborescences with bandwidth constraints
• The item dependent stockingcost constraint
• A randomly weighted minimum arborescence with a random cost constraint
• Total Weight Choosability of Trees
• Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
• A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
• The tree Constraint
• Models and heuristics for a minimum arborescence problem
• The weighted arborescence constraint
• scientific article; zbMATH DE number 933178 (Why is no real title available?)

Describes a project that uses

Uses Software

• OscaR
• CP4CAP

This page was built for publication: The weighted arborescence constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011589)