Berge-acyclic multilinear 0-1 optimization problems
From MaRDI portal
Publication:1991264
DOI10.1016/j.ejor.2018.07.045zbMath1403.90513OpenAlexW2560847365MaRDI QIDQ1991264
Christoph Buchheim, Elisabeth Rodríguez-Heck, Yves Cramer
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.045
Related Items
On the complexity of binary polynomial optimization over acyclic hypergraphs, The Multilinear Polytope for Acyclic Hypergraphs, The Running Intersection Relaxation of the Multilinear Polytope, Matroid optimization problems with monotone monomials in the objective
Uses Software
Cites Work
- Data aggregation for \(p\)-median problems
- Hypergraphs with no special cycles
- Concave extensions for nonlinear 0-1 maximization problems
- Pseudo-Boolean optimization
- Complexity of local search for the \(p\)-median problem
- Unimodular functions
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- A column generation approach to job grouping for flexible manufacturing systems
- Branch and peg algorithms for the simple plant location problem.
- Matroid optimisation problems with nested non-linear monomials in the objective function
- A class of valid inequalities for multilinear 0-1 optimization problems
- The cut polytope and the Boolean quadric polytope
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A bibliography for some fundamental problem categories in discrete location science
- Balanced matrices
- On the notion of balance of a signed graph
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Nonlinear Integer Programming
- L’algebre de Boole et ses applications en recherche operationnelle
- Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
- Worst-case performance of approximation algorithms for tool management problems
- The Multilinear Polytope for Acyclic Hypergraphs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- A Polyhedral Study of Binary Polynomial Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
