The air-cargo consolidation problem with pivot weight: models and solution methods

DOI10.1016/J.COR.2014.11.015zbMath1348.90070OpenAlexW2508381094MaRDI QIDQ337525

Samir Elhedhli, Zichao Li, James H. Bookbinder

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.015

zbMATH Keywords

Lagrangian relaxationcolumn generationnetwork planninglocal branchingbranch and priceair transportationpivot weight

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (3)

Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs

Cites Work

• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A class of generalized greedy algorithms for the multi-knapsack problem
• Heuristics for the container loading problem
• Column generation approaches to ship scheduling with flexible cargo sizes
• A note on an open-end bin packing problem

This page was built for publication: The air-cargo consolidation problem with pivot weight: models and solution methods