The following pages link to Branching rules revisited (Q1886796):
Displayed 15 items.
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
- A branching scheme for finding cost-minimal round robin tournaments (Q1011262) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)