The following pages link to Michael Perregaard (Q697567):
Displaying 12 items.
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Solving large-scale QAP problems in parallel with the serach library ZRAM (Q1268834) (← links)
- Parallel branch-and-bound methods for the job-shop scheduling problem (Q1273123) (← links)
- Solving large quadratic assignment problems in parallel (Q1366297) (← links)
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel (Q1384091) (← links)
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (Q1411611) (← links)
- On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q2819224) (← links)
- Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study (Q2901067) (← links)
- (Q4537754) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q4637828) (← links)
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver (Q4685752) (← links)
