Model and algorithms for multi-period sea cargo mix problem

DOI10.1016/J.EJOR.2006.05.012zbMath1124.90300OpenAlexW2032133219MaRDI QIDQ872163

James S. K. Ang, Chengxuan Cao, Heng Qing Ye

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.05.012

zbMATH Keywords

heuristic algorithmlogistics0-1 integer programsea cargo mix

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Boolean programming (90C09)

Related Items (4)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ A travel demand management strategy: the downtown space reservation system

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for large multiple knapsack problems
• The 0-1 knapsack problem with multiple choice constraints
• Core Problems in Knapsack Algorithms
• A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
• Routing Container Ships Using Lagrangean Relaxation and Decomposition
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Dynamic and Stochastic Models for the Allocation of Empty Containers

This page was built for publication: Model and algorithms for multi-period sea cargo mix problem