The stacker crane problem and the directed general routing problem
From MaRDI portal
Publication:4642462
DOI10.1002/net.21591zbMath1390.90051OpenAlexW1985786410MaRDI QIDQ4642462
José María Sanchis, Thais Ávila, Isaac Plana, Angel Corberán
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/99717
branch-and-cut algorithmstacker crane problemdirected rural postman problemdirected general routing problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (7)
A branch-and-cut algorithm for the orienteering arc routing problem ⋮ The profitable close-enough arc routing problem ⋮ Modeling and solving the endpoint cutting problem ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ The min-max close-enough arc routing problem
This page was built for publication: The stacker crane problem and the directed general routing problem