Pages that link to "Item:Q4321311"
From MaRDI portal
The following pages link to Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 (Q4321311):
Displaying 15 items.
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Random allocation of jobs with weights and precedence (Q1365938) (← links)
- Dynamic load balancing in computational mechanics (Q1574346) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← 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)
- Computational study of a family of mixed-integer quadratic programming problems (Q1814787) (← links)
- Application of a hybrid genetic algorithm to airline crew scheduling (Q1915974) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate (Q4629373) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q4637828) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
