Optimization of transportation requirements in the deployment of military units
DOI10.1016/J.COR.2005.06.016zbMATH Open1102.90300OpenAlexW2114617126MaRDI QIDQ856693FDOQ856693
Authors: İbrahim Akgün, B. 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
Recommendations
mobilitytransportationbranch and boundmixed integer programminglarge-scale optimizationmilitarydeploymentrestriction and relaxation
Large-scale problems in mathematical programming (90C06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (11)
- Deployment method of prefabricated component transport vehicle
- A graph coloring approach to the deployment scheduling and unit assignment problem
- CHAC, A MOACO algorithm for computation of bi-criteria military unit path in the battlefield: Presentation and first results
- Optimizing the military transportation path with stochastic loss in war
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
- Efficient strategies for transporting mobile forces
- Problem difficulty of real instances of convoy planning
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- The assignment and loading transportation problem
- Modelling and analysis of Canadian Forces strategic lift and pre-positioning options
Uses Software
This page was built for publication: Optimization of transportation requirements in the deployment of military units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856693)