Matches in SemOpenAlex for { <https://semopenalex.org/work/W24915542> ?p ?o ?g. }
- W24915542 abstract "ASurveyofParallelSearchAlgorithmsforDiscreteOptimizationProblemsAnanth Y. Grama andVipin KumarDepartment of Computer Science,University ofMinnesota4-192,200Union Street S.E.Minneap olis, MN 55455Phone:(612)6248083Email:ananth@cs.umn.edukumar@cs.umn.eAbstractDiscrete optimization problems (DOPs) arise in various applications such as planning, schedul-ing, computeraided design, rob otics,game playing and constraintdirectedreasoning.Often,a DOPis formulated in terms of nding a(minimum cost)solution pathin a graphfrom aninitial no detoa goal no deand solvedby graph/treesearchmetho ds.Availability of parallelcomputers has created substantial interest in exploring parallel formulations of these graph andtreesearchmetho ds.This article provides a surveyof various parallel searcalgorithms sucas Backtracking, IDA*, A*, Branch-and-Bound techniques and Dynamic Programming.It ad-dressesissues related to load balancing, communication costs, scalability and the phenomenonof sp eedup anomalies in parallel search.Discrete optimization problems (DOPs) arise in various applications such as planning, schedul-ing, computer aided design, rob otics, game playing and constraint directedreasoning.Formally, aDOPcanb estated asfollows:Givena nitediscretesetXandfunctionf(x)de nedontheelementsofX, ndanoptimalelementxoptsuchthat,f()=min=xXg.Incertainproblems, the aim is to nd any memb er of a solution setSX.These problems can also b e easilystated inthe ab ove format by makingf(x) = 0 for allxS, and) = 1 for allother elements ofX.Inmostproblemsofpracticalinterest,thesetXisquitelarge.Consequently,exhaustiveenumeration of elements inXto determinexoptis not feasible.Often, elements ofcan b e viewedaspathsingraphs/trees,thecostfunctioncanb ede nedtermsofarcs,andthe DOP can b e formulated in terms of ndinga (minimum cost) solution path in the graph fromaninitialno deto agoalno de.Branchandb ound[85],dynamicprogramming[14]heuristic1" @default.
- W24915542 created "2016-06-24" @default.
- W24915542 creator A5019202832 @default.
- W24915542 date "2007-01-01" @default.
- W24915542 modified "2023-09-26" @default.
- W24915542 title "A Survey of Parallel Search Algorithms for Discrete Optimization Problems" @default.
- W24915542 cites W133581358 @default.
- W24915542 cites W14537281 @default.
- W24915542 cites W1505010820 @default.
- W24915542 cites W1513182422 @default.
- W24915542 cites W1521982276 @default.
- W24915542 cites W1522829112 @default.
- W24915542 cites W1546644053 @default.
- W24915542 cites W1554451661 @default.
- W24915542 cites W1555673550 @default.
- W24915542 cites W1555807722 @default.
- W24915542 cites W1567684443 @default.
- W24915542 cites W158654210 @default.
- W24915542 cites W1588745704 @default.
- W24915542 cites W1593705580 @default.
- W24915542 cites W1603765807 @default.
- W24915542 cites W1689272351 @default.
- W24915542 cites W178035362 @default.
- W24915542 cites W1866420487 @default.
- W24915542 cites W1870063920 @default.
- W24915542 cites W1889301694 @default.
- W24915542 cites W1964182510 @default.
- W24915542 cites W1967644553 @default.
- W24915542 cites W1970390910 @default.
- W24915542 cites W1977119258 @default.
- W24915542 cites W1980502498 @default.
- W24915542 cites W1984263429 @default.
- W24915542 cites W1986324265 @default.
- W24915542 cites W1988845780 @default.
- W24915542 cites W1994172977 @default.
- W24915542 cites W1994230528 @default.
- W24915542 cites W2001443617 @default.
- W24915542 cites W2005774723 @default.
- W24915542 cites W2005933636 @default.
- W24915542 cites W2005979170 @default.
- W24915542 cites W2009029907 @default.
- W24915542 cites W2014497078 @default.
- W24915542 cites W2022443350 @default.
- W24915542 cites W2026186621 @default.
- W24915542 cites W2030685258 @default.
- W24915542 cites W2037651963 @default.
- W24915542 cites W2043811185 @default.
- W24915542 cites W2048586177 @default.
- W24915542 cites W2050733200 @default.
- W24915542 cites W2051586165 @default.
- W24915542 cites W2062533874 @default.
- W24915542 cites W2066784071 @default.
- W24915542 cites W2082897183 @default.
- W24915542 cites W2083754010 @default.
- W24915542 cites W2086077660 @default.
- W24915542 cites W2088185592 @default.
- W24915542 cites W2090121564 @default.
- W24915542 cites W2091012988 @default.
- W24915542 cites W2093171965 @default.
- W24915542 cites W2097984521 @default.
- W24915542 cites W2109560070 @default.
- W24915542 cites W2118447814 @default.
- W24915542 cites W2120059802 @default.
- W24915542 cites W2144931885 @default.
- W24915542 cites W2146766934 @default.
- W24915542 cites W2150470619 @default.
- W24915542 cites W2152732518 @default.
- W24915542 cites W2154216324 @default.
- W24915542 cites W2164498514 @default.
- W24915542 cites W2166915329 @default.
- W24915542 cites W2167539320 @default.
- W24915542 cites W2170563778 @default.
- W24915542 cites W2171603032 @default.
- W24915542 cites W2231883621 @default.
- W24915542 cites W2292380207 @default.
- W24915542 cites W25062087 @default.
- W24915542 cites W2528497791 @default.
- W24915542 cites W2752885492 @default.
- W24915542 cites W2970943183 @default.
- W24915542 cites W3021035068 @default.
- W24915542 cites W3121235808 @default.
- W24915542 cites W34076215 @default.
- W24915542 cites W40726722 @default.
- W24915542 cites W45554583 @default.
- W24915542 cites W73149113 @default.
- W24915542 cites W92959217 @default.
- W24915542 cites W69549612 @default.
- W24915542 hasPublicationYear "2007" @default.
- W24915542 type Work @default.
- W24915542 sameAs 24915542 @default.
- W24915542 citedByCount "9" @default.
- W24915542 countsByYear W249155422013 @default.
- W24915542 countsByYear W249155422019 @default.
- W24915542 crossrefType "journal-article" @default.
- W24915542 hasAuthorship W24915542A5019202832 @default.
- W24915542 hasConcept C11413529 @default.
- W24915542 hasConcept C126255220 @default.
- W24915542 hasConcept C132525143 @default.
- W24915542 hasConcept C156884757 @default.
- W24915542 hasConcept C33923547 @default.