Backdoors to Combinatorial Optimization: Feasibility and Optimality
From MaRDI portal
Publication:3630152
DOI10.1007/978-3-642-01929-6_6zbMath1241.68099OpenAlexW1595428830MaRDI QIDQ3630152
Bistra Dilkina, Ashish Sabharwal, Meinolf Sellmann, Yuri Malitsky, Carla P. Gomes
Publication date: 3 June 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_6
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Learning pseudo-backdoors for mixed integer programs ⋮ Branching on nonchimerical fractionalities ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ Backdoor Branching ⋮ How important are branching decisions: fooling MIP solvers ⋮ Backdoors in the Context of Learning
Uses Software
This page was built for publication: Backdoors to Combinatorial Optimization: Feasibility and Optimality
