scientific article; zbMATH DE number 1114466
From MaRDI portal
Publication:4377051
zbMath0891.68043MaRDI QIDQ4377051
François Guertin, Jean-Yves Potvin
Publication date: 8 February 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains ⋮ Approximation Algorithms for Not Necessarily Disjoint Clustered TSP ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Metaheuristics for the tabu clustered traveling salesman problem ⋮ Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards ⋮ Picker Routing in AGV-Assisted Order Picking Systems ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Achieving feasibility for clustered traveling salesman problems using PQ‐trees ⋮ New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
This page was built for publication:
