Minimizing settlements

DOI10.1016/J.JMATECO.2023.102840MaRDI QIDQ6100485zbMATH OpenOpenAlexFDO

Authors Guillaume Haeringer

Publication date 22 June 2023

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmateco.2023.102840

zbMATH Keywords

NP-completenesspartition problemsettlements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• On a decentralized transportation problem
• An algorithm for optimal shipments with given frequencies
• On the computational complexity of the maximum trade problem
• Reshipments and overshipments in transportation problems with minimax objective
• scientific article; zbMATH DE number 803930

Cites work

• Fixed-cost transportation problems

This page was built for publication: Minimizing settlements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100485)