LS(graph): a constraint-based local search for constraint optimization on trees and paths
DOI10.1007/S10601-012-9124-0zbMATH Open1309.90089OpenAlexW1973394110MaRDI QIDQ487640FDOQ487640
Authors: 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
Recommendations
- Constraint-based local search for constrained optimum paths problems
- A constraint programming framework for local search methods
- Solving the quorumcast routing problem by constraint programming
- A constraint-based local search for edge disjoint rooted distance-constrained minimum spanning tree problem
- scientific article; zbMATH DE number 2159472
graphscombinatorial optimizationedge-disjoint pathsconstraint-based local searchconstrained optimum pathsconstrained optimum treesquorumcast routingrouting and wavelength assignment with delay constraints
Cites Work
- Network flows. Theory, algorithms, and applications.
- An overtraining-resistant stochastic modeling method for pattern recognition
- A data structure for dynamic trees
- Using Lagrangian dual information to generate degree constrained spanning trees
- Recursive Star-Tree Parallel Data Structure
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Lowest common ancestors in trees and directed acyclic graphs
- Routing and wavelength assignment by partition colouring
- Self-adjusting binary search trees
- A bicriterion approach for routing problems in multimedia networks
- Local search for the Steiner tree problem in the Euclidean plane
- Self-adjusting top trees
- Maintaining information in fully dynamic trees with top trees
- An algorithm for the resource constrained shortest path problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Dual heuristics on the exact solution of large Steiner problems
- Title not available (Why is that?)
- Local Search for the Asymmetric Traveling Salesman Problem
- Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Fast local search algorithms for the handicapped persons transportation problem
- Approximating disjoint-path problems using packing integer programs
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
- Simple on-line algorithms for the maximum disjoint paths problem
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- A fast search algorithm for the quorumcast routing problem.
- Approximation algorithms for disjoint paths and related routing and packing problems
- Parallel Local Search in Comet
- Constraint-based local search for constrained optimum paths problems
- A Data Structure for Dynamically Maintaining Rooted Trees
- Title not available (Why is that?)
- Obtaining optimal k -cardinality trees fast
- Dynamic trees in practice
- Comparison of algorithms for the degree constrained minimum spanning tree
Cited In (4)
- Solving the edge‐disjoint paths problem using a two‐stage method
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
- Constraint-based local search for constrained optimum paths problems
Uses Software
This page was built for publication: LS(graph): a constraint-based local search for constraint optimization on trees and paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487640)
