Pages that link to "Item:Q2270439"
From MaRDI portal
The following pages link to Faster MIP solutions via new node selection rules (Q2270439):
Displaying 7 items.
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
- Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
- Comments on: ``On learning and branching: a survey'' (Q5971157) (← links)