NP Hard Optimality

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
1,655
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Jan 6, 2009

One of the last open questions in Operations Research is the BinPacking problem. The problem in its bare bone form is NP Complete. Any solution to NP Complete leads to Stockholm and the Nobel Prize.

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 2 dislikes

Link to this comment:

Share to:
see all

All Comments (1)

Sign In or Sign Up now to post a comment!
  • There is not exits Nobel Prize in mathematics

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more