University of Iowa 3 credits BAIS
Design of heuristic search algorithms to find good (near-optimal) solutions to difficult (NP-hard) optimization problems that occur in many disciplines; basic heuristic concepts (local search, greedy search, problem decomposition) which serve as fundamental constructs for metaheuristics, including simulated annealing, genetic algorithms, tabu search, variable neighborhood search; introduction to various optimization problems and survey of various heuristic approaches; underlying theoretical structure of several heuristic methods; how to implement a heuristic algorithm.
Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β written from scratch to your course requirements.
Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.
Expert guides on essay writing, citation styles, study skills, and academic success.
View All Articles
Learn how to write a good research question for a paper. Narrow your topic, identify a research problem, and create a focused question with practical examples.
Learn how to choose a research topic you can actually research. Discover how to narrow broad ideas, find reliable sources, and develop a focused research question.
Learn how to cite sources in a research paper using APA, MLA, and Chicago styles, with in-text citation examples and reference-list tips.