Pages that link to "Item:Q429675"
From MaRDI portal
The following pages link to Information-theoretic approaches to branching in search (Q429675):
Displaying 11 items.
- Expressive markets for donating to charities (Q646531) (← links)
- Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- A theory of information with special application to search problems (Q4532709) (← links)
- (Q4577935) (← links)
- (Q4736595) (← links)
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
- One-shot learning for MIPs with SOS1 constraints (Q6579097) (← links)
