Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies

DOI10.1287/MNSC.46.7.973.12032zbMath1231.90076OpenAlexW2050279167MaRDI QIDQ3116771

Luca Bertazzi, Walter Ukovich, Maria Grazia Speranza

Publication date: 12 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.46.7.973.12032

zbMATH Keywords

heuristicstransportationinventorybranch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (3)

Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Inventory Routing ⋮ Multi-product lot-sizing with a transportation capacity reservation contract

This page was built for publication: Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies