LS(graph): a constraint-based local search for constraint optimization on trees and paths
From MaRDI portal
Publication:487640
DOI10.1007/s10601-012-9124-0zbMath1309.90089OpenAlexW1973394110MaRDI QIDQ487640
Quang Dung Pham, Yves Deville, Pascal Van Hentenryck
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9124-0
combinatorial optimizationgraphsedge-disjoint pathsconstraint-based local searchconstrained optimum pathsconstrained optimum treesquorumcast routingrouting and wavelength assignment with delay constraints
Related Items (max. 100)
Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Routing and wavelength assignment by partition colouring
- An overtraining-resistant stochastic modeling method for pattern recognition
- Approximating disjoint-path problems using packing integer programs
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
- Local search for the Steiner tree problem in the Euclidean plane
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- A data structure for dynamic trees
- Simple on-line algorithms for the maximum disjoint paths problem
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- Using Lagrangian dual information to generate degree constrained spanning trees
- Fast local search algorithms for the handicapped persons transportation problem
- A fast search algorithm for the quorumcast routing problem.
- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
- Maintaining information in fully dynamic trees with top trees
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Parallel Local Search in Comet
- Constraint-Based Local Search for Constrained Optimum Paths Problems
- Self-adjusting binary search trees
- An algorithm for the resource constrained shortest path problem
- Local Search for the Asymmetric Traveling Salesman Problem
- Recursive Star-Tree Parallel Data Structure
- A Data Structure for Dynamically Maintaining Rooted Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A bicriterion approach for routing problems in multimedia networks
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Obtaining optimal k -cardinality trees fast
- Dynamic trees in practice
- Lowest common ancestors in trees and directed acyclic graphs
- Comparison of algorithms for the degree constrained minimum spanning tree
This page was built for publication: LS(graph): a constraint-based local search for constraint optimization on trees and paths
