A new heuristic algorithm for laser antimissile strategy optimization
From MaRDI portal
Publication:2358875
DOI10.3934/jimo.2012.8.457zbMath1364.90370OpenAlexW2329808037MaRDI QIDQ2358875
Publication date: 16 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2012.8.457
heuristic algorithmparallel navigationadjacent exchangelaser antimissile systemrelative ordinal number
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Solving vehicle routing problems using constraint programming and metaheuristics
This page was built for publication: A new heuristic algorithm for laser antimissile strategy optimization