SelfSplit parallelization for mixed-integer linear programming

•SelfSplit an easy-to-implement way to parallelize a sequential tree-search code.•SelfSplit is deterministic and requires (almost) no communication among workers.•We investigate the performance of SelfSplit when applied to a MILP solver.•Both ad-hoc and general purpose MILP solvers are considered.•C...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & operations research Ročník 93; s. 101 - 112
Hlavní autori:	Fischetti, Matteo, Monaci, Michele, Salvagnin, Domenico
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.05.2018 Pergamon Press Inc
Predmet:	Algorithms Computational analysis Enumerative algorithms Integer programming Linear programming Mixed-integer programming Operations research Parallel computing Parallel processing Solvers Parallel computing Computational analysis Mixed-integer programming Enumerative algorithms
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!