Projection heuristics for binary branchings between sum and product

DOI10.1007/978-3-030-80223-3_21OpenAlexW3184885839MaRDI QIDQ2118310

Oleg Sergeevich Zaikin, Oliver Kullmann

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• DLMF
• tawSolver
• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• Exact exponential algorithms.
• A branch-and-price algorithm for the minimum latency problem
• An abstract model for branching and its application to mixed integer programming
• Gate elimination: circuit size lower bounds and \#SAT upper bounds
• Further results on an abstract model for branching and its application to mixed integer programming
• Improved branch-cut-and-price for capacitated vehicle routing
• Effective Incorporation of Double Look-Ahead Procedures
• A machine program for theorem-proving

This page was built for publication: Projection heuristics for binary branchings between sum and product