Optimizing a Parking Lot Problem. Is this problem NP-Complete?

Posted by Adam Gent on Stack Overflow See other posts from Stack Overflow or by Adam Gent
Published on 2010-05-13T17:38:06Z Indexed on 2010/05/13 18:14 UTC
Read the original article Hit count: 186

What algorithms (brute force or not) would I use to put in as many cars (assume all cars are the same size) in a parking lot so that there is at least one exit (from the container) and a car cannot be blocked. Or can someone show me an example of this problem solved programmatically.

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about np-complete