Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
Published Online:1 Dec 2007https://doi.org/10.1287/opre.1070.0440
References
- Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Programming (2001) 91:71–97Crossref, Google Scholar
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Oper. Res. Lett. (2003) 31:185–194Crossref, Google Scholar
- A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. (2002) 123:75–102Crossref, Google Scholar
- Determination of optimal assignment of a weapon system to several targets. (1961) . AER-EITM-9, Vought Aeronautics, Dallas, TXGoogle Scholar
- Advanced weapon-target assignment algorithm. (1987) (ALPHA TECH, Inc., Burlington, MA) . Quarterly Report #TR-337Google Scholar
- Assignment algorithm for kinetic energy weapons in boost defense. Proc. IEEE 26th Conf. Decision and Control (1987) Los Angeles, CA:1678–1683Crossref, Google Scholar
- Allocating weapons to target complexes by means of nonlinear programming. Oper. Res. (1966) 14:992–1013Link, Google Scholar
- On optimum target assignments. Oper. Res. (1958) 7:322–326Link, Google Scholar
- Mathematical models of target coverage and missile allocation. (1972) . Report, Military Operations Research Society, Alexandria, VAGoogle Scholar
- Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (1984) 34:596–615Crossref, Google Scholar
- Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. (1998) . CRT Research Report No. CRT-98-10, Centre for Research on Transportation, University of Montreal, Montreal, Quebec, CanadaGoogle Scholar
- Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. (1996) 65:223–253Crossref, Google Scholar
- An integer solution heuristic for the arsenal exchange model (AEM). Military Oper. Res. Soc. (1997) 3(2):5–16Crossref, Google Scholar
- A solution of the multi-weapon, multi-target assignment problem. (1986) . Working Paper 26957, MITRE, McLean, VAGoogle Scholar
- A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. (1999) 11:161–172Link, Google Scholar
- Weapons allocation is NP-complete. Proc. 1986 Summer Conf. Simulation (1986) Reno, NV:1054–1058Google Scholar
- A review of the literature on the missile-allocation problem. Oper. Res. (1970) 18:334–373Link, Google Scholar
- A target-assignment problem. Oper. Res. (1958) 6:346–351Link, Google Scholar
- A suite of weapon assignment algorithms for a SDI mid-course battle manager. (1990) . NRL Memorandum Report 671, Naval Research Laboratory, Washington, D.C.Google Scholar
- , Pardalos P. M., Pitsoulis L. S. Target-based weapon target assignment problems. Nonlinear Assignment Problems: Algorithms and Applications (1999) (Kluwer Academic Publishers, Boston, MA) 39–53Google Scholar
- Linear and Combinatorial Optimization (1976) (John Wiley, New York) Google Scholar
- Optimal weapons allocation against layered defenses. Naval Res. Logist. (1987) 34:605–616Crossref, Google Scholar
- , Osman I. H., Kelly J. P. Parallel tabu search algorithm using ejection chains for the vehicle routing problem. Metaheuristics: Theory and Applications (1996) (Kluwer Academic Publishers, Boston, MA) 661–675Crossref, Google Scholar
- The theory of cyclic transfers. (1989) . Operations Research Center Report 200-89, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
- Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Oper. Res. (1993) 41:935–946Link, Google Scholar
- A neural network-based optimization algorithm for the static weapon-target assignment problem. ORSA J. Comput. (1989) 4:232–246Link, Google Scholar

