Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

From MaRDI portal

Revision as of 10:26, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5449670

Jump to:navigation, search

DOI10.1002/NET.20245zbMath1180.90021OpenAlexW4254990966MaRDI QIDQ5449670

Manuel Iori, Michel Gendreau, Gilbert Laporte, Silvano Martello

Publication date: 12 March 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20245

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ Routing problems with loading constraints ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Container loading with multi-drop constraints

This page was built for publication: Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5449670&oldid=20221355"