The ring tree facility location problem
From MaRDI portal
Publication:324831
DOI10.1016/j.endm.2015.07.055zbMath1347.05230OpenAlexW2198160212WikidataQ115575504 ScholiaQ115575504MaRDI QIDQ324831
Fabio Henrique N. Abe, Alessandro Hill, Edna A. Hoshino
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.055
integer programmingcombinatorial optimizationfacility locationnetwork designSteiner treescapacitated ring tree problem
Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
A branch-and-price algorithm for the ring-tree facility location problem, Exact algorithms for bi-objective ring tree problems with reliability measures, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, Generalized local branching heuristics and the capacitated ring tree problem, Capacitated ring arborescence problems with profits
Uses Software
Cites Work