An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334): Difference between revisions

Latest revision as of 02:17, 1 August 2024

scientific article; zbMATH DE number 7683674

Language	Label	Description	Also known as
English	An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading	scientific article; zbMATH DE number 7683674

Statements

instance of

scholarly article

0 references

title

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (English)

0 references

author

Francesco Carrabs

0 references

Raffaele Cerulli

0 references

Jean-François Cordeau

0 references

published in

INFOR: Information Systems and Operational Research

0 references

publication date

9 May 2023

0 references

zbMATH Keywords

traveling salesman problem

0 references

pickup and delivery

0 references

LIFO loading

0 references

FIFO loading

0 references

additive branch-and-bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3056948

0 references

A note on finding optimum branchings

0 references

New lower bounds for the symmetric travelling salesman problem

0 references

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

0 references

Q5567717

0 references

Optimum branchings

0 references

An Additive Bounding Procedure for Combinatorial Optimization Problems

0 references

An additive bounding procedure for the asymmetric travelling salesman problem

0 references

An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs

0 references

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

0 references

The traveling salesman problem and its variations

0 references

A new extension of local search applied to the Dial-A-Ride problem

0 references

An algorithm for the traveling salesman problem with pickup and delivery customers

0 references

Optimal routing of multiple-load AGV subject to LIFO loading constraints

0 references

An Algorithm for the Traveling Salesman Problem

0 references

Perturbation heuristics for the pickup and delivery traveling salesman problem

0 references

A heuristic for the pickup and delivery traveling salesman problem

0 references

The pickup and delivery problem: Faces and branch-and-cut algorithm

0 references

An efficient implementation of local search algorithms for constrained routing problems

0 references

Finding optimum branchings

0 references

Q3036721

0 references

Identifiers

DOI

10.3138/infor.45.4.223

0 references

Mathematics Subject Classification ID

90-XX

0 references

zbMATH DE Number

7683674

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6160334

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding optimum branchings
@@ Property / cites work: A note on finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for the symmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+An additive bounding procedure for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+A new extension of local search applied to the Dial-A-Ride problem
+Normal rank
@@ Property / cites work @@
+An algorithm for the traveling salesman problem with pickup and delivery customers
+Normal rank
@@ Property / cites work @@
+Optimal routing of multiple-load AGV subject to LIFO loading constraints
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Perturbation heuristics for the pickup and delivery traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A heuristic for the pickup and delivery traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The pickup and delivery problem: Faces and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+An efficient implementation of local search algorithms for constrained routing problems
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3036721
@@ Property / cites work: Q3036721 / rank @@
+Normal rank