Learn More
T he two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is-hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the(More)
Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval. For more information, contact(More)
—Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes a new path based MIP model for the Liner shipping Network(More)
—The design of container shipping networks is an important real world problem, with assets and operational costs in billions of dollars. To guide the optimal deployment of the ships, a single vessel roundtrip is considered by minimizing operational costs and flowing the best paying cargo under commercial constraints. Inspiration for formulation and solution(More)
  • 1