Distributed Solving of Mixed-Integer Programs with COIN-OR CBC and Thrift

Jakob Görner, Ramon Janssen and Jochen Rethmann ()
Additional contact information
Jakob Görner: Niederrhein University of Applied Sciences
Ramon Janssen: Niederrhein University of Applied Sciences
Jochen Rethmann: Niederrhein University of Applied Sciences

A chapter in Operations Research Proceedings 2021, 2022, pp 141-147 from Springer

Abstract: Abstract We present a distributed solver for mixed-integer problems. Our aim is to offer an alternative to commercial solvers so that even small companies come to the benefit of an optimization suite. The solver utilizes the COIN-OR Branch-and-Cut solver (CBC) for solving subproblems. Interprocess communication is achieved by using the remote procedure call library Thrift. Using ordinary office hardware, we evaluate our solution on instances from the MIPLIB and multidimensional knapsack instances both in deterministic and non-deterministic mode.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:lnopch:978-3-031-08623-6_22

Ordering information: This item can be ordered from
http://www.springer.com/9783031086236

DOI: 10.1007/978-3-031-08623-6_22

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().