Using Lagrangian dual information to generate degree constrained spanning trees, Discrete Applied Mathematics, vol.154, issue.5, pp.703-717, 2006. ,
DOI : 10.1016/j.dam.2005.06.011
A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data, UAI '02, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence, pp.18-25 ,
A branch and cut method for the degree-constrained minimum spanning tree problem, Networks, vol.12, issue.2, pp.74-83, 2001. ,
DOI : 10.1002/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E
On Formulations and Methods for the Hop, 2004. ,
Graph constraints in constraint programming : Weighted Spanning Trees, INGI Research Report, 2006. ,
Two Algorithms for Generating Weighted Spanning Trees in Order, SIAM Journal on Computing, vol.6, issue.1, pp.139-150, 1977. ,
DOI : 10.1137/0206011
http ://www.gecode.org/. generic constraint development environment ,
Shorter Path Constraints for the Resource Constrained Shortest Path Problem . Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.201-216, 2005. ,
A Search-Infer-and-Relax Framework for Integrating Solution Methods. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.243-257, 2005. ,
Au sujet de certaines contraintes globales An efficient bounds consistency algorithm for the global cardinality constraint, JFPC2005 Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, pp.600-614, 2003. ,
Cost-based filtering for shorter path constraints. Principles and Practice of Constraint Programming -CP, pp.694-708, 2003. ,
Theoretical Foundations of CP-Based Lagrangian Relaxation. Principles and Practice of Constraint Programming CP, pp.634-647, 2004. ,
Applications of Path Compression on Balanced Trees, Journal of the ACM, vol.26, issue.4, pp.690-715, 1979. ,
DOI : 10.1145/322154.322161
Design and Analysis of Data Structures for Dynamic Trees, 2006. ,