On optimization problems in acyclic hypergraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3683635 (Why is no real title available?)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Algorithms for the maximum satisfiability problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Degrees of acyclicity for hypergraphs and relational database schemes
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- LP formulations for polynomial optimization problems
- On characterization of maximal independent sets via quadratic optimization
- On the notion of cycles in hypergraphs
- Pseudo-Boolean optimization
- Satisfiability of acyclic and almost acyclic CNF formulas
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- Sums of squares, moment matrices and optimization over polynomials
- The Running Intersection Relaxation of the Multilinear Polytope
- The basic algorithm for pseudo-Boolean programming revisited
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- The unconstrained binary quadratic programming problem: a survey
Cited in
(6)- Topic and opinion infused hypergraphs for influence maximization
- The hypergraph assignment problem
- scientific article; zbMATH DE number 5670148 (Why is no real title available?)
- scientific article; zbMATH DE number 3893238 (Why is no real title available?)
- An extremal problem in the hypercube and optimization of asynchronous circuits
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
This page was built for publication: On optimization problems in acyclic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161450)
