A multi-product loading problem: A model and solution method
From MaRDI portal
Publication:1278990
DOI10.1016/S0377-2217(96)00185-3zbMath0916.90100MaRDI QIDQ1278990
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Lagrangian relaxationset partitioningmixed binary modelmulti-product loading problemvehicle loading problem
Related Items (3)
The petrol station replenishment problem with time windows ⋮ Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle ⋮ Tank allocation problems in maritime bulk shipping
Cites Work
- Unnamed Item
- Unnamed Item
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Max-Min Allocation Problem: Its Solutions and Applications
- Algorithms for the Multi-Resource Generalized Assignment Problem
- An Algorithm for Large Set Partitioning Problems
- Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
- Cross decomposition for mixed integer programming
- Dispatching Petroleum Products
This page was built for publication: A multi-product loading problem: A model and solution method
