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

DOI10.1142/s0129054123420054OpenAlexW4382284586MaRDI QIDQ6087776

Tetsuo Asano

Publication date: 16 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123420054

zbMATH Keywords

treelinear programmingtransportation problemNP-completedemandsupplyalgorithm designpseudoforestpseudotreeone-way transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A faster parameterized algorithm for pseudoforest deletion
• A survey of transportation problems
• The earth mover's distance as a metric for image retrieval
• Reverse search for enumeration
• More planar two-center algorithms
• Transportation problem on a graph
• 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
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• The Transportation Problem and its Variants
• Transportation Problem Allowing Sending and Bringing Back

This page was built for publication: Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands