Abstract
A set of sellers have to ship certain quantities of a homogeneous good to a set of buyers. The objective is to minimize the number of shipments when the shipping costs only depend on the number of shipments. We provide an upper bound on the minimum number of settlements, but we show that knowing whether the minimum number of settlements can be lower for a given problem is an NP-complete problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
