A new transportation problem on a graph with sending and bringing-back operations

DOI10.1007/978-3-030-68211-8_2OpenAlexW3131542862MaRDI QIDQ2232226

Tetsuo Asano

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_2

zbMATH Keywords

NP-completenesslinear programforestmulti-commodity transportation problemsending and bringing-back

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ Transportation Problem Allowing Sending and Bringing Back ⋮ Transportation problem on a graph

Cites Work

• The Transportation Problem and its Variants
• Unnamed Item
• Unnamed Item

This page was built for publication: A new transportation problem on a graph with sending and bringing-back operations