Pages that link to "Item:Q1683695"
From MaRDI portal
The following pages link to An abstract model for branching and its application to mixed integer programming (Q1683695):
Displaying 20 items.
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Comments on: ``On learning and branching: a survey'' (Q2408516) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- Evaluating mixed-integer programming models over multiple right-hand sides (Q6047695) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications (Q6180277) (← links)
- On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)
- An abstract model for branch and cut (Q6589748) (← links)
