Optimization of transportation requirements in the deployment of military units

DOI10.1016/j.cor.2005.06.016zbMath1102.90300OpenAlexW2114617126MaRDI QIDQ856693

İbrahim Akgün, Barbaros C. Tansel

Publication date: 7 December 2006

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

Full work available at URL: http://hdl.handle.net/11693/23494

zbMATH Keywords

transportationlarge-scale optimizationbranch and boundmixed integer programmingmilitarymobilitydeploymentrestriction and relaxation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (4)

hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem ⋮ Enhancing Benders decomposition algorithm to solve a combat logistics problem ⋮ CHAC, A MOACO algorithm for computation of bi-criteria military unit path in the battlefield: Presentation and first results ⋮ The assignment and loading transportation problem

Uses Software

• CPLEX

Cites Work

• A review of strategic mobility models supporting the defense transportation system
• Optimizing Military Airlift
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization of transportation requirements in the deployment of military units