Transportation problem on a graph

DOI10.1007/s13160-022-00516-zOpenAlexW4282964178MaRDI QIDQ2111557

Tetsuo Asano

Publication date: 17 January 2023

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-022-00516-z

zbMATH Keywords

linear programmingpolynomial-time algorithmtransportation problemvehicleone-commodity and multi-commodity problemspseudo-forest

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands

Uses Software

• VRP
• EMD

Cites Work

• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A survey of transportation problems
• The earth mover's distance as a metric for image retrieval
• A new transportation problem on a graph with sending and bringing-back operations
• Properties of the \(d\)-dimensional Earth mover's problem
• Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
• The Vehicle Routing Problem
• The Transportation Problem and its Variants
• Unnamed Item

This page was built for publication: Transportation problem on a graph