Parallel branch, cut, and price for large-scale discrete optimization
From MaRDI portal
Publication:1424299
DOI10.1007/s10107-003-0404-8zbMath1082.90102OpenAlexW1969501661MaRDI QIDQ1424299
Matthew J. Saltzman, Laszlo Ladanyi, Ted K. Ralphs
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0404-8
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Parallelization of the FICO Xpress-Optimizer, PEBBL: an object-oriented framework for scalable parallel branch and bound, FiberSCIP—A Shared Memory Parallelization of SCIP, Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm, A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs, Parallel Solution Methods for Vehicle Routing Problems, Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy, Parallelization of the FICO Xpress-Optimizer, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants
Uses Software
