Pages that link to "Item:Q1667215"

The following pages link to Using diversification, communication and parallelism to solve mixed-integer linear programs (Q1667215):

Displayed 8 items.

• Improving branch-and-cut performance by random sampling (Q266414) ‎ (← links)
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) ‎ (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) ‎ (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) ‎ (← links)
• A dual heuristic for mixed integer programming (Q1785392) ‎ (← links)
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) ‎ (← links)
• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) ‎ (← links)
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) ‎ (← links)