Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452): Difference between revisions

Latest revision as of 10:03, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming	scientific article

Statements

instance of

scholarly article

0 references

title

Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (English)

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

4 December 2008

0 references

zbMATH Keywords

combinatorial optimization

0 references

traveling salesman problem

0 references

shortest path problem

0 references

dynamic programming

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2008.01.003

0 references

cites work

Accelerated label setting algorithms for the elementary resource constrained shortest path problem

0 references

New dynamic programming algorithms for the resource constrained elementary shortest path problem

0 references

The traveling salesman problem: An overview of exact and approximate algorithms

0 references

The orienteering problem

0 references

An Optimal Algorithm for the Orienteering Tour Problem

0 references

Solving the Orienteering Problem through Branch-and-Cut

0 references

Q4540081

0 references

The Orienteering Problem with Time Windows

0 references

Algorithms - ESA 2003

0 references

An exact algorithm for team orienteering problems

0 references

A tabu search heuristic for periodic and multi-depot vehicle routing problems

0 references

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

0 references

Shortest Path Problems with Resource Constraints

0 references

An algorithm for the resource constrained shortest path problem

0 references

Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem

0 references

Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

0 references

State-space relaxation procedures for the computation of bounds to routing problems

0 references

Identifiers

zbMATH Open document ID

1162.90548

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.COR.2008.01.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:958452

@@ Property / DOI @@
-.1016/j.cor.2008.01.003
@@ Property / DOI: 10.1016/j.cor.2008.01.003 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2008.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1991744719
@@ Property / OpenAlex ID: W1991744719 / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated label setting algorithms for the elementary resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+New dynamic programming algorithms for the resource constrained elementary shortest path problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem: An overview of exact and approximate algorithms
+Normal rank
@@ Property / cites work @@
+The orienteering problem
@@ Property / cites work: The orienteering problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Orienteering Tour Problem
+Normal rank
@@ Property / cites work @@
+Solving the Orienteering Problem through Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Q4540081
@@ Property / cites work: Q4540081 / rank @@
+Normal rank
@@ Property / cites work @@
+The Orienteering Problem with Time Windows
@@ Property / cites work: The Orienteering Problem with Time Windows / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for team orienteering problems
@@ Property / cites work: An exact algorithm for team orienteering problems / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search heuristic for periodic and multi-depot vehicle routing problems
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Shortest Path Problems with Resource Constraints
@@ Property / cites work: Shortest Path Problems with Resource Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
+Normal rank
@@ Property / cites work @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2008.01.003
@@ Property / DOI: 10.1016/J.COR.2008.01.003 / rank @@
+Normal rank