Minimizing Lid Overstows in Master Stowage Plans for Container Vessels is NP-Complete

[1]  Peer Giemsch,et al.  Optimization Models for the Containership Stowage Problem , 2004 .

[2]  J.-G. Kang,et al.  Stowage planning in maritime container transportation , 2002, J. Oper. Res. Soc..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Gregory Levitin,et al.  A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem , 2002, J. Heuristics.

[5]  Mordecai Avriel,et al.  Stowage planning for container ships to reduce the number of shifts , 1998, Ann. Oper. Res..

[6]  R. C. Botter,et al.  Stowage Container Planning: A Model for Getting an Optimal Solution , 1991, Computer Applications in the Automation of Shipyard Operation and Ship Design.

[7]  Paul A. Roach,et al.  Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning , 1999, J. Heuristics.

[8]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[9]  Anna Sciomachen,et al.  Stowing a containership: the master bay plan problem , 2004 .

[10]  Mordecai Avriel,et al.  Container ship stowage problem: complexity and connection to the coloring of circle graphs , 2000, Discret. Appl. Math..

[11]  Anna Sciomachen,et al.  A decomposition heuristics for the container ship stowage problem , 2006, J. Heuristics.

[12]  Sriram Khé.  The Box: How the Shipping Container Made the World Smaller and the World Economy Bigger , 2008 .