Berge-acyclic multilinear 0-1 optimization problems
From MaRDI portal
Recommendations
Cites work
- A bibliography for some fundamental problem categories in discrete location science
- A class of valid inequalities for multilinear 0-1 optimization problems
- A column generation approach to job grouping for flexible manufacturing systems
- A polyhedral study of binary polynomial programs
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Balanced matrices
- Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
- Branch and peg algorithms for the simple plant location problem.
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Complexity of local search for the \(p\)-median problem
- Concave extensions for nonlinear 0-1 maximization problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Data aggregation for \(p\)-median problems
- Degrees of acyclicity for hypergraphs and relational database schemes
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Facility location: discrete models and local search methods
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3378707 (Why is no real title available?)
- Hypergraphs with no special cycles
- L’algebre de Boole et ses applications en recherche operationnelle
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Nonlinear integer programming
- On the Desirability of Acyclic Database Schemes
- On the notion of balance of a signed graph
- Pseudo-Boolean optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The cut polytope and the Boolean quadric polytope
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The multilinear polytope for acyclic hypergraphs
- Unimodular functions
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Worst-case performance of approximation algorithms for tool management problems
Cited in
(11)- A class of valid inequalities for multilinear 0-1 optimization problems
- Matroid optimization problems with monotone monomials in the objective
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Short paper -- The binary linearization complexity of pseudo-Boolean functions
- Quadratization and convexification in polynomial binary optimization
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
This page was built for publication: Berge-acyclic multilinear 0-1 optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991264)
