A stochastic programming approach for the traveling purchaser problem

DOI10.1093/imaman/dpv022zbMath1433.90024OpenAlexW2292826472MaRDI QIDQ5382708

Daniele Manerba, Maria Elena Bruni, Renata Mansini, Patrizia Beraldi

Publication date: 18 June 2019

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/dpv022

zbMATH Keywords

beam searchbranch-and-cuttwo-stage stochastic programmingtraveling purchaser problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Related Items (7)

The bi-objective traveling purchaser problem with deliveries ⋮ New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities ⋮ The risk-averse traveling repairman problem with profits

This page was built for publication: A stochastic programming approach for the traveling purchaser problem