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

DOI10.1142/S0129054123420054MaRDI QIDQ6087776zbMATH OpenOpenAlexFDO

Authors 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

algorithm designdemandlinear programmingNP-completeone-way transportationpseudoforestpseudotreesupplytransportation problemtree

Mathematics Subject Classification ID

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

Recommendations

• Transportation problem on a graph
• Multiparametric demand transportation problem
• Partitioning graphs of supply and demand
• Minimum Cost Partitions of Trees with Supply and Demand
• Minimum cost partitions of trees with supply and demand

Cites work

• A faster parameterized algorithm for pseudoforest deletion
• A new transportation problem on a graph with sending and bringing-back operations
• A survey of transportation problems
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
• More planar two-center algorithms
• Properties of the \(d\)-dimensional Earth mover's problem
• Reverse search for enumeration
• The earth mover's distance as a metric for image retrieval
• The Transportation Problem and its Variants
• The vehicle routing problem
• Transportation Problem Allowing Sending and Bringing Back
• Transportation problem on a graph

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

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