Large-scale optimization planning methods for the distribution of United States army munitions

DOI10.1016/S0895-7177(04)90549-3zbMath1055.90515OpenAlexW2033094336MaRDI QIDQ1767085

Xianqiang Yang

Publication date: 4 March 2005

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(04)90549-3

zbMATH Keywords

optimizationdistributionschedulinglarge-scaleammunitionsealift

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
• Routing Container Ships Using Lagrangean Relaxation and Decomposition
• Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area
• The Engine Scheduling Problem In A Railway Network

This page was built for publication: Large-scale optimization planning methods for the distribution of United States army munitions