Projection heuristics for binary branchings between sum and product

DOI10.1007/978-3-030-80223-3_21MaRDI QIDQ2118310zbMATH OpenOpenAlexFDO

Authors Oliver Kullmann, Oleg Sergeevich Zaikin

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

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

Recommendations

• Combinatorial proof of the Prodinger formulas about binary trees
• Branch decomposition heuristics for linear matroids
• A Heuristic for Direct Product Graph Decomposition
• scientific article; zbMATH DE number 2084778
• Boolean Minimization of Projected Sums of Products via Boolean Relations
• A Minimizing Algorithm for Sum of Disjoint Products
• A branch bound method for subset sum problem
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• Projection results for the \(k\)-partition problem
• A branch-and-cut algorithm for a class of sum-of-ratios problems

Cites work

• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A branch-and-price algorithm for the minimum latency problem
• A machine program for theorem-proving
• An abstract model for branching and its application to mixed integer programming
• Effective Incorporation of Double Look-Ahead Procedures
• Exact exponential algorithms.
• Further results on an abstract model for branching and its application to mixed integer programming
• Gate elimination: circuit size lower bounds and \#SAT upper bounds
• Improved branch-cut-and-price for capacitated vehicle routing
• Inequalities on the Lambert \(W\) function and hyperpower function
• NIST handbook of mathematical functions
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)

Describes a project that uses

Uses Software

• MathOverflow
• tawSolver
• DLMF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118310)