Maintaining longest paths incrementally
DOI10.1007/S10601-005-0554-9zbMATH Open1084.68027OpenAlexW2006906930MaRDI QIDQ816679FDOQ816679
Authors: Irit Katriel, Laurent Michel, Pascal Van Hentenryck 
Publication date: 23 February 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-0554-9
Recommendations
- Maintaining longest paths incrementally
- Maintaining Longest Paths in Cyclic Graphs
- Incremental algorithms for minimal length paths
- Longest increasing paths with gaps
- scientific article; zbMATH DE number 3974318
- Dynamically maintaining shortest path trees under batches of updates
- On approximating the longest path in a graph
- Longest increasing paths with Lipschitz constraints
- Algorithms for long paths in graphs
- Longest paths joining given vertices in a graph
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- SALSA: a language for search algorithms
- Localizer
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Temporal constraint networks
- A simple tabu search for warehouse location
- Applying tabu search to the job-shop scheduling problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- A general approach for constraint solving by local search
- On the computational complexity of dynamic graph problems
- Solving systems of difference constraints incrementally
- Amortized Computational Complexity
- Title not available (Why is that?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Title not available (Why is that?)
- Online topological ordering
- Insertion techniques for the heuristic solution of the job shop problem
- Improved local search for CP toolkits
- Optimization software class libraries
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Maintaining longest paths incrementally
Cited In (7)
- A batch-oblivious approach for complex job-shop scheduling problems
- Maintaining Longest Paths in Cyclic Graphs
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- A dynamic topological sort algorithm for directed acyclic graphs
- Maintaining longest paths incrementally
Uses Software
This page was built for publication: Maintaining longest paths incrementally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816679)
