Minisum collection depots location problem with multiple facilities on a network

DOI10.1057/palgrave.jors.2601742zbMath1095.90001OpenAlexW1987229601MaRDI QIDQ4661204

Rong-Bing Huang, Oded Berman

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601742

zbMATH Keywords

Lagrangian relaxationbranch and boundnetworkslocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (6)

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ The planar multifacility collection depots location problem ⋮ The transfer point location problem ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ Collection depots facility location problems in trees ⋮ Single facility collection depots location problem in the plane

This page was built for publication: Minisum collection depots location problem with multiple facilities on a network