Minimizing settlements

Guillaume Haeringer

Journal of Mathematical Economics, 2023, vol. 106, issue C

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.

Keywords: Settlements; Partition problem; NP-completeness (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406823000332
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:106:y:2023:i:c:s0304406823000332

DOI: 10.1016/j.jmateco.2023.102840

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().