Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms
From MaRDI portal
Publication:2418170
DOI10.1007/s10100-018-0576-1OpenAlexW2885352275MaRDI QIDQ2418170
Publication date: 3 June 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-018-0576-1
Related Items (3)
Routing and scheduling field service operation by P-graph ⋮ Editorial ⋮ Modeling technique in the P-graph framework for operating units with flexible input ratios
Cites Work
- Unnamed Item
- Branch-and-bound and parallel computation: A historical note
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
This page was built for publication: Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms