scientific article

From MaRDI portal
Revision as of 14:20, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3343723

zbMath0551.90018MaRDI QIDQ3343723

Bruce L. Golden, Arjang A. Assad, Roy W. Dahl

Publication date: 1984


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (24)

A variable neighborhood search for the multi-period collection of recyclable materialsA two phase variable neighborhood search for the multi-product inventory routing problemInventory routing with continuous movesUsing artificial neural networks to solve the orienteering problemRouting problems: A bibliographyUsing and extending fix-and-relax to solve maritime inventory routing problemsRecyclable waste collection planning -- a case studyRecent challenges in Routing and Inventory Routing: E‐commerce and last‐mile deliverySolving Relaxation Orienteering Problem Using DCA-CUTIntegrating purchasing and routing in a propane gas supply chain.Inventory RoutingOn symmetric subtour problemsLocal search for the undirected capacitated arc routing problem with profitsVehicle minimization for periodic deliveriesThe integrated production-inventory-distribution-routing problemIndustrial aspects and literature survey: Combined inventory management and routingA branch-and-price algorithm for an integrated production and inventory routing problemNew mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approachA Hybrid Heuristic for an Inventory Routing ProblemThe team orienteering problemA fast and effective heuristic for the orienteering problemVendor managed inventory for environments with stochastic product usageModeling inventory routing problems in supply chains of high consumption productsA heuristic for the multiple tour maximum collection problem







This page was built for publication: