The ring tree facility location problem

DOI10.1016/J.ENDM.2015.07.055MaRDI QIDQ324831zbMATH OpenOpenAlexWikidataFDO

Authors Fabio Henrique N. Abe, Edna A. Hoshino, Alessandro Hill

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.055

zbMATH Keywords

combinatorial optimizationinteger programmingfacility locationnetwork designSteiner treescapacitated ring tree problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Optimal capacitated ring trees
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Multi-exchange neighborhoods for the capacitated ring tree problem
• The Capacitated m-Ring-Star Problem
• On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines

Cites work

• scientific article; zbMATH DE number 1041084 (Why is no real title available?)
• Multi-exchange neighborhoods for the capacitated ring tree problem
• SCIP: solving constraint integer programs

Cited in

(7)

• Optimal capacitated ring trees
• Capacitated ring arborescence problems with profits
• Exact algorithms for bi-objective ring tree problems with reliability measures
• A branch-and-price algorithm for the ring-tree facility location problem
• Multi-exchange neighborhoods for the capacitated ring tree problem
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• Generalized local branching heuristics and the capacitated ring tree problem

Describes a project that uses

Uses Software

• SoPlex
• SCIP

This page was built for publication: The ring tree facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324831)