Projection heuristics for binary branchings between sum and product
From MaRDI portal
Publication:2118310
DOI10.1007/978-3-030-80223-3_21OpenAlexW3184885839MaRDI QIDQ2118310FDOQ2118310
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
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
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)
Cites Work
- NIST handbook of mathematical functions
- Title not available (Why is that?)
- Exact exponential algorithms.
- Inequalities on the Lambert \(W\) function and hyperpower function
- A machine program for theorem-proving
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Improved branch-cut-and-price for capacitated vehicle routing
- Gate elimination: circuit size lower bounds and \#SAT upper bounds
- A branch-and-price algorithm for the minimum latency problem
- An abstract model for branching and its application to mixed integer programming
- Further results on an abstract model for branching and its application to mixed integer programming
- Effective Incorporation of Double Look-Ahead Procedures
Uses Software
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)
