Pages that link to "Item:Q1424299"
From MaRDI portal
The following pages link to Parallel branch, cut, and price for large-scale discrete optimization (Q1424299):
Displaying 17 items.
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
- 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 (Q1725624) (← links)
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- A library hierarchy for implementing scalable parallel search algorithms (Q1771087) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- An exact method for balancing efficiency and equity in the liver allocation hierarchy (Q2815444) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q2819224) (← links)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- (Q3596895) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q4637828) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs (Q5387645) (← links)
- An asynchronous parallel benders decomposition method for stochastic network design problems (Q6551056) (← links)
