Optimization of transportation requirements in the deployment of military units
From MaRDI portal
Publication:856693
DOI10.1016/j.cor.2005.06.016zbMath1102.90300MaRDI 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
transportation; large-scale optimization; branch and bound; mixed integer programming; military; mobility; deployment; restriction and relaxation
90C06: Large-scale problems in mathematical programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
Related Items
hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem, The assignment and loading transportation 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
Uses Software
Cites Work