Scribd Logo
Upload

Welcome to Scribd!

  • Greedy Method

    Uploaded by

    Arjun kumar
    7 views2 pages
    The document describes an algorithm to solve an optimization problem by making locally optimal choices at each step to build up to a global solution. It does this by always choosing the next move that offers the most immediate benefit to progress toward solving the problem. The algorithm works heuristically by using local optimization at each step rather than trying to optimize the overall problem globally at once. Tables of numbers are provided as examples of the data the algorithm would operate on.

    Original Description:

    Greedy method question answer

    Original Title

    greedy method

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an algorithm to solve an optimization problem by making locally optimal choices at each step to build up to a global solution. It does this by always choosing the next move that offers the most immediate benefit to progress toward solving the problem. The algorithm works heuristically by using local optimization at each step rather than trying to optimize the overall problem globally at once. Tables of numbers are provided as examples of the data the algorithm would operate on.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Greedy Method

    Uploaded by

    Arjun kumar
    The document describes an algorithm to solve an optimization problem by making locally optimal choices at each step to build up to a global solution. It does this by always choosing the next move that offers the most immediate benefit to progress toward solving the problem. The algorithm works heuristically by using local optimization at each step rather than trying to optimize the overall problem globally at once. Tables of numbers are provided as examples of the data the algorithm would operate on.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Pa)N

    Dine Civeedy AlJori th. Solve knupsatk problenm


    vin grerdg Me hod profitS 1o IS 1 8 9
    w iaht 34 3 2 W I5 n:]

    _*gTed algonith is any ojow#hm hut o/oasp


    the broplkm_ soing heuvistk q muking the
    localy ptimadchoite o eath shu 9Gedy
    in olgonithwnicbaadign that buld» upq
    solutin here b e ire, always choing he'nert
    biae that ofrsthei mestobviou ans immediqgR
    beniit problem wherhooin loraly opHme
    aloleod o_q/obof olv honarbesf {it for

    obrrts 1 2 3 4 S 67
    S4
    Proits 510 15 78
    1 3 s 4: 13 2
    eight

    W15 , n 7

    ) 3.333 7.8 32
    1 1 0 11 1
    3 M4
    PageN
    Date

    IS-1 1
    1412 13.
    D-3 10
    0-S
    S-3 2

    2-2 O

    1x1t1x3 t 1S+Ox4 +Ax1 +13 t1x2


    i t 35F1t3 12

    miPË 4x5 +1a10 +11S tox7t


    1K7 t1X9+1x

    51

    You might also like