### Re^2: Golf: Grocery Bagging

 on May 23, 2001 at 20:18 UTC ( #82605=note: print w/replies, xml ) Need Help??

in reply to Re: Golf: Grocery Bagging

It is NP-complete, so there's no way a super-efficient general solution is going to emerge here. However, the evaluation of any particular ordering doesn't require evaluating all possible groupings of that ordering. You can merely start adding stuff until an overflow occurs, switching to the next bag as necessary. The "best" solution out of the possibilities evaluated is the one that uses the least containers.

Perl is buff enough to spin through several million possibilities in realistic time, unless you're using a version of Perl for Palm Pilot. I would submit that as long as a Perl Golf program runs in finite time (even extremely, exponentially long), the point is to make a minimally sized program that produces the correct solution.

Replies are listed 'Best First'.
Re: Re^2: Golf: Grocery Bagging
by merlyn (Sage) on May 23, 2001 at 20:22 UTC
You can merely start adding stuff until an overflow occurs, switching to the next bag as necessary.
No, I thought that too, at first, but you've got the problem of having permitted negative elements, so adding the next element might overflow, but the element after that (if negative) might bring it back. Argh!

So while there might be a solution other than generating all possible partitions and seeing which ones have acceptable weights, it's not along the line of "fill until it won't fit". Sorry.

It might, but if you're going to evaluate all possibilities, who cares? As in, if you are worried about a scenario such as the following, where the 10 gets bagged "solo" despite there being a -5 farther down the pipeline:      ( [ 9 ], [ 10, -5], [ 11 ] )
Then later on you will inevitably evaluate a scenario where the -5 is inserted earlier.      ( [ 9, -5, 10 ], [11] )
So, taking the "brute force" approach, you might lose points for style, but you get the job done, no?

Has anyone ever pointed out to a grocery checker that the bagging problem was NP-complete? The result might be similar to explaining that dogs can solve quadratic equations (i.e. capturing a frisbee in a parabolic arc while in linear motion).
Has anyone ever pointed out to a grocery checker that the bagging problem was NP-complete?
Has anyone ever had a grocery bagger that optimally bagged their groceries? Fortunately, the greedy heuristic which baggers generally use is not NP-complete =)
```   MeowChow
s aamecha.s a..a\u\$&owag.print```

Create A New User
Node Status?
node history
Node Type: note [id://82605]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (2)
As of 2018-04-22 05:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My travels bear the most uncanny semblance to ...

Results (82 votes). Check out past polls.

Notices?