On the integer programming formulation for the relaxed restricted container relocation problem

DOI10.1016/J.EJOR.2019.08.041zbMath1430.90093OpenAlexW2970840787MaRDI QIDQ2333026

Bo Jin

Publication date: 6 November 2019

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

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

zbMATH Keywords

integer programmingcombinatorial optimizationcontainer relocation problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Uses Software

• BRP

Cites Work

• A mathematical formulation and complexity considerations for the blocks relocation problem
• A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• A heuristic rule for relocating blocks

This page was built for publication: On the integer programming formulation for the relaxed restricted container relocation problem