Corrigendum to: ``Solving the family traveling salesman problem

DOI10.1016/J.EJOR.2021.06.043MaRDI QIDQ2239977zbMATH OpenOpenAlexFDO

Authors Raquel Bernardino, Ana Paias

Publication date 5 November 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2021.06.043

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• scientific article; zbMATH DE number 2049010
• Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
• Erratum

Cites work

• Solving the family traveling salesman problem

Cited in

(1)

• Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem

This page was built for publication: Corrigendum to: ``Solving the family traveling salesman problem

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