Bistra Dilkina

Available identifiers

Publication	Date of Publication	Type
Local branching relaxation heuristics for integer linear programs	2023-10-04	Paper
Predicting wildlife trafficking routes with differentiable shortest paths	2023-10-04	Paper
Learning pseudo-backdoors for mixed integer programs	2022-08-30	Paper
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems	2022-05-20	Paper
Achieving full connectivity of sites in the multiperiod reserve network design problem	2018-07-11	Paper
Comments on: ``On learning and branching: a survey	2017-10-12	Paper
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search	2014-09-26	Paper
Upgrading Shortest Paths in Networks	2011-05-26	Paper
Solving Connected Subgraph Problems in Wildlife Conservation	2010-06-22	Paper
Backdoors in the Context of Learning	2009-07-07	Paper
Backdoors to Combinatorial Optimization: Feasibility and Optimality	2009-06-03	Paper
Tradeoffs in the Complexity of Backdoor Detection	2008-09-02	Paper

This page was built for person: Bistra Dilkina