On the restricted Steiner multi cycle problem

DOI10.1016/J.COR.2024.106752MaRDI QIDQ6979399zbMATH OpenFDO

Authors Vinicius de Novaes Guimarães Pereira, Mário César San Felice, Pedro Henrique Del Bianco Hokama, Eduardo C. Xavier

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106752

zbMATH Keywords

heuristicspickup-and-deliveryroutingSteiner cycle

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A General Approximation Technique for Constrained Forest Problems
• A probabilistic heuristic for a computationally difficult set covering problem
• Approximability of the minimum Steiner cycle problem
• Benchmarking optimization software with performance profiles.
• Clustering to minimize the maximum intercluster distance
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Multi-Terminal Network Flows
• Optimization by GRASP. Greedy randomized adaptive search procedures
• POPMUSIC for the travelling salesman problem
• Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane
• Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
• Shipper collaboration
• The ellipsoid method and its consequences in combinatorial optimization
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The Steiner cycle polytope
• Vehicle Routing
• Very Simple Methods for All Pairs Network Flow Analysis

This page was built for publication: On the restricted Steiner multi cycle problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979399)