CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 2 of 2
  1. April 27th, 2006, 02:19 PM #1
    yperez_riverol
    yperez_riverol is offline Junior Member
    Join Date
    Apr 2006
    Posts
    1

    Algorithms partition

    I need an algorithms Partition S = {1,2,3,7,6,....n} into k subset, so as to minimize the maximum sum over all the ranges.
    Reply With Quote Reply With Quote
  2. May 8th, 2006, 10:57 AM #2
    DragForce
    DragForce is offline Member
    Join Date
    Feb 2006
    Location
    London
    Posts
    238

    Re: Algorithms partition

    If n an k are reasonably small use dynamic programming. Otherwise you will need to use heuristic algorithms.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules




Click Here to Expand Forum to Full Width

Featured