The following pages link to Bistra Dilkina (Q457252):
Displaying 11 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Learning pseudo-backdoors for mixed integer programs (Q2170189) (← links)
- Upgrading Shortest Paths in Networks (Q3003277) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- Solving Connected Subgraph Problems in Wildlife Conservation (Q3569923) (← links)
- Backdoors to Combinatorial Optimization: Feasibility and Optimality (Q3630152) (← links)
- Backdoors in the Context of Learning (Q3637159) (← links)
- Comments on: ``On learning and branching: a survey'' (Q5971157) (← links)
- Cover-Relax-Search: A Primal Heuristic for Binary Quadratic Programs (Q6761678) (← links)
