Transportation Problem Allowing Sending and Bringing Back
From MaRDI portal
(Redirected from Transportation Problem Allowing Sending and Bringing Back)
Cites work
- A faster parameterized algorithm for pseudoforest deletion
- A linear-time algorithm for finding a minimum spanning pseudoforest
- A new transportation problem on a graph with sending and bringing-back operations
- A survey of transportation problems
- Complexity of independent set reconfigurability 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?)
- Introduction to algorithms
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- On the complexity of reconfiguration problems
- Properties of the \(d\)-dimensional Earth mover's problem
- Reconfiguration of cliques in a graph
- Reconfiguration of colorable sets in classes of perfect graphs
- Reverse search for enumeration
- The earth mover's distance as a metric for image retrieval
- The Transportation Problem and its Variants
Cited in
(1)
This page was built for publication: Transportation Problem Allowing Sending and Bringing Back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175213)
