The weighted arborescence constraint (Q2011589)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The weighted arborescence constraint	scientific article

Statements

scholarly article

0 references

The weighted arborescence constraint (English)

0 references

Vinasetan Ratheil Houndji

0 references

0 references

Laurence A. Wolsey

0 references

Mahouton Norbert Hounkonnou

0 references

publication date

4 August 2017

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-59776-8_15

0 references

The tree Constraint

0 references

0 references

0 references

The Minimum Spanning Tree Constraint

0 references

The “Not-Too-Heavy Spanning Tree” Constraint

0 references

Optimum branchings

0 references

Cost based filtering for the constrained knapsack problem

0 references

An additive bounding procedure for the asymmetric travelling salesman problem

0 references

A Polyhedral Approach to the Asymmetric Traveling Salesman Problem

0 references

A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem

0 references

Solving TSP through the Integration of OR and CP Techniques

0 references

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

0 references

On the History of the Minimum Spanning Tree Problem

0 references

An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem

0 references

The weighted arborescence constraint

0 references

0 references

Algorithm Theory - SWAT 2004

0 references

An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

0 references

Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint

0 references

The Weighted Spanning Tree Constraint Revisited

0 references

Finding optimum branchings

0 references

Understanding the Potential of Propagators

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-59776-8_15

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2011589

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2011589&oldid=36337608"