Complexity of the Transshipment Problem with a Permutable Transit Vector
In this paper, we show that the transshipment problem with a permutable transit vector remains NP-hard even when each entry of the given transit vector takes either zero or two. We prove the hardness by a reduction from an NP-complete problem by the name of 3DM. We also show that the transshipment p...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
The Japan Society of Mechanical Engineers
2010-06-01
|
| Schriftenreihe: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Schlagworte: | |
| Online-Zugang: | https://www.jstage.jst.go.jp/article/jamdsm/4/3/4_3_664/_pdf/-char/en |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|