An efficient solution for K-center problems
Abstract
Recommendations
Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05: Proceedings of the 4th international conference on Experimental and Efficient AlgorithmsMany problems in combinatorial optimization are NP-Hard. This has forced researchers to explore meta-heuristic techniques for dealing with this class of complex problems and finding an acceptable solution in reasonable time. The satisfiability problem, ...
A GRASP based solution approach to solve cardinality constrained portfolio optimization problems
A novel metaheuristic which combines GRASP with quadratic programming techniques.An algorithm which combines meta-heuristic and exact solution approaches.Novel solution generation techniques with several local search procedures.The proposed approach is ...
A novel GRASP solution approach for the Orienteering Problem
The Orienteering Problem (OP) is a well-known variant of the Traveling Salesman Problem. In this paper, a novel Greedy Randomized Adaptive Search Procedure (GRASP) solution is proposed to solve the OP. The proposed method is shown to outperform state-of-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
IEEE Press
Publication History
Check for updates
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 35Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in