Transportation Problem Allowing Sending and Bringing Back

DOI10.1142/s0129054122500289OpenAlexW4317401807MaRDI QIDQ6175213

Tetsuo Asano

Publication date: 18 August 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/s0129054122500289

zbMATH Keywords

treelinear programmingdynamic programmingNP-completenesstransportation problemalgorithm designpseudotree

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph theory (05C99)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of independent set reconfigurability problems
• On the complexity of reconfiguration problems
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• A linear-time algorithm for finding a minimum spanning pseudoforest
• 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
• 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
• Reconfiguration of colorable sets in classes of perfect graphs
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Reconfiguration of Cliques in a Graph
• The Transportation Problem and its Variants

This page was built for publication: Transportation Problem Allowing Sending and Bringing Back