The “Not-Too-Heavy Spanning Tree” Constraint-Reference-Cited by-同舟云学术

The “Not-Too-Heavy Spanning Tree” Constraint

Published:2007 Issue: Volume: Page:59-70
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Dooms Grégoire,Katriel Irit

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72397-4_5

Reference28 articles.

1. Aron, I.D., Van Hentenryck, P.: A constraint satisfaction approach to the robust spanning tree problem with interval data. In: UAI, pp. 18–25 (2002)

2. Azevedo, F.: Cardinal: A finite sets constraint solver. Constraints, 12(1), to appear (2007)

3. Lecture Notes in Computer Science;N. Beldiceanu,2005

4. Lecture Notes in Computer Science;N. Beldiceanu,2006

5. Cambazard, H., Bourreau, E.: Conception d’une contrainte globale de chemin. In: 10e Journ. nat. sur la résolution pratique de problèmes NP-complets (JNPC’04), pp. 107–121 (2004)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019

2. The Weighted Arborescence Constraint;Integration of AI and OR Techniques in Constraint Programming;2017

3. Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems;Integration of AI and OR Techniques in Constraint Programming;2017

4. Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems;Lecture Notes in Computer Science;2013

5. Solving the quorumcast routing problem by constraint programming;Constraints;2012-07-08