Problem 1173. Binpack Contest: Retro - - Best Packing

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/contest/contests/3/rules\"><w:r><w:t>Full Binpack Rules and examples</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is a partial replay of the First Matlab Contest, 1998 BinPack. The Twist is to Achieve the Best Packing, no time or code size penalty. The twelve songList sets will be scored once each.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Brief Challenge statement: Pack a 45(mediaLength) minute CD as maximally as possible given a list of songs of varying lengths. No penalty for unused songs. No song duplication allowed. Return the indices of the songs used.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> [songList, mediaLength]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> indexList</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Input: [ 0.5 2 3 1.5 4], [5.6]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Output: [4 5] as 1.5+4 is very near and below 5.6.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The answer of [1 2 3] is also valid and also gives 5.5.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Scoring:</w:t></w:r><w:r><w:t> 1000*(Known_Best_Possibles - sum(songList(indexList))</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Initial Leader:</w:t></w:r><w:r><w:t> Cases [2 3 4 6 8 11] have best possible scores of [44.9990 44.9971 44.8 44.6 44.584024853.. 44.25]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Final Score of 1 achieved in &lt; 6 Cody seconds for entry 10.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Final Score of 0, optimal, achieved using recursive searches with iter limits and thresholds.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The <a href="http://www.mathworks.com/matlabcentral/contest/contests/3/rules">Full Binpack Rules and examples</a>.This Challenge is a partial replay of the First Matlab Contest, 1998 BinPack. The Twist is to Achieve the Best Packing, no time or code size penalty. The twelve songList sets will be scored once each.Brief Challenge statement: Pack a 45(mediaLength) minute CD as maximally as possible given a list of songs of varying lengths. No penalty for unused songs. No song duplication allowed. Return the indices of the songs used.Input: [songList, mediaLength]Output: indexListExample:Input: [ 0.5 2 3 1.5 4], [5.6]Output: [4 5] as 1.5+4 is very near and below 5.6.The answer of [1 2 3] is also valid and also gives 5.5.Scoring: 1000*(Known_Best_Possibles - sum(songList(indexList))Initial Leader: Cases [2 3 4 6 8 11] have best possible scores of [44.9990 44.9971 44.8 44.6 44.584024853.. 44.25]Final Score of 1 achieved in &lt; 6 Cody seconds for entry 10.Final Score of 0, optimal, achieved using recursive searches with iter limits and thresholds.

Solve

Solution Stats

21 Solutions
6 Solvers

Last Solution submitted on Dec 31, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

trekker on 4 Jan 2013

so bintprog is not allowed by cody?

Richard Zapor on 4 Jan 2013

Cody appears to have an access issue with bintprog, Optimization Toolbox.

Problem Recent Solvers6

Problem Tags

contest optimiozation recursion

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1173. Binpack Contest: Retro - - Best Packing

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author246

Problem Tags

Community Treasure Hunt

Problem 1173. Binpack Contest: Retro - - Best Packing

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author246

Problem Tags

Community Treasure Hunt

Players