A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem
- 16 April 2015
- book chapter
- Published by Springer Nature
- p. 31-46
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem2015
- From Sequential to Parallel Local Search for SATLecture Notes in Computer Science, 2013
- LS(Graph): a constraint-based local search for constraint optimization on trees and pathsConstraints, 2012
- Deployment Strategies for Protected Long-Reach PONJournal of Optical Communications and Networking, 2012
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree ProblemLecture Notes in Computer Science, 2011
- A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem2009
- Constructing minimal spanning/Steiner trees with bounded path lengthIntegration, 1997