Pages that link to "Item:Q1935943"
From MaRDI portal
The following pages link to Could we use a million cores to solve an integer program? (Q1935943):
Displaying 14 items.
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Using diversification, communication and parallelism to solve mixed-integer linear programs (Q1667215) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing (Q2273651) (← links)
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
- On relations between chance constrained and penalty function problems under discrete distributions (Q2392789) (← links)
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
