New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675): Difference between revisions

Latest revision as of 07:51, 7 July 2024

scientific article; zbMATH DE number 6256368

Language	Label	Description	Also known as
English	New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times	scientific article; zbMATH DE number 6256368

Statements

instance of

scholarly article

0 references

title

New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (English)

0 references

0 references

0 references

0 references

0 references

0 references

7 February 2014

0 references

zbMATH Keywords

traveling salesman problem

0 references

integer programming

0 references

tour duration

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2013.824445

0 references

cites work

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

0 references

Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

0 references

Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows

0 references

An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

0 references

Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints

0 references

A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows

0 references

An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

0 references

A polyhedral study of the asymmetric traveling salesman problem with time windows

0 references

A Hybrid Exact Algorithm for the TSPTW

0 references

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

0 references

An ant colony system approach for variants of the traveling salesman problem with time windows

0 references

A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

0 references

Beam-ACO for the travelling salesman problem with time windows

0 references

A general VNS heuristic for the traveling salesman problem with time windows

0 references

The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

0 references

Identifiers

zbMATH Open document ID

1282.90107

0 references

DOI

10.1080/02331934.2013.824445

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5746675

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2013.824445
+Normal rank
@@ Property / OpenAlex ID @@
+W2021842356
@@ Property / OpenAlex ID: W2021842356 / rank @@
+Normal rank
@@ Property / cites work @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / cites work @@
+Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
+Normal rank
@@ Property / cites work @@
+A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
+Normal rank
@@ Property / cites work @@
+An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+A polyhedral study of the asymmetric traveling salesman problem with time windows
+Normal rank
@@ Property / cites work @@
+A Hybrid Exact Algorithm for the TSPTW
@@ Property / cites work: A Hybrid Exact Algorithm for the TSPTW / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+An ant colony system approach for variants of the traveling salesman problem with time windows
+Normal rank
@@ Property / cites work @@
+A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Beam-ACO for the travelling salesman problem with time windows
+Normal rank
@@ Property / cites work @@
+A general VNS heuristic for the traveling salesman problem with time windows
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5746675