Berge-acyclic multilinear 0-1 optimization problems
type: Item
instance of: scholarly article
title: Berge-acyclic multilinear 0-1 optimization problems
zbMATH Open document ID: 1403.90513
author: Christoph Buchheim
author: Elisabeth Rodríguez-Heck
author: Yves Crama
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6968132
zbMATH Keywords: nonlinear programming
zbMATH Keywords: integer programming
zbMATH Keywords: standard linearization
zbMATH Keywords: balanced matrix
zbMATH Keywords: signed hypergraph
describes a project that uses: JBool
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.07.045
OpenAlex ID: W2560847365
cites work: Data aggregation for \(p\)-median problems
cites work: Complexity of local search for the \(p\)-median problem
cites work: Hypergraphs with no special cycles
cites work: On the Desirability of Acyclic Database Schemes
cites work: Q3941433
cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
cites work: Pseudo-Boolean optimization
cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
cites work: Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
cites work: Balanced \(0,\pm 1\) matrices. I: Decomposition
cites work: Balanced matrices
cites work: Concave extensions for nonlinear 0-1 maximization problems
cites work: Combinatorial optimization models for production scheduling in automated manufacturing systems
cites work: Q3077976
cites work: Worst-case performance of approximation algorithms for tool management problems
cites work: Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
cites work: A column generation approach to job grouping for flexible manufacturing systems
cites work: A class of valid inequalities for multilinear 0-1 optimization problems
cites work: The cut polytope and the Boolean quadric polytope
cites work: Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
cites work: A Polyhedral Study of Binary Polynomial Programs
cites work: The Multilinear Polytope for Acyclic Hypergraphs
cites work: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
cites work: Degrees of acyclicity for hypergraphs and relational database schemes
cites work: Matroid optimisation problems with nested non-linear monomials in the objective function
cites work: Q3270229
cites work: L’algebre de Boole et ses applications en recherche operationnelle
cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Branch and peg algorithms for the simple plant location problem.
cites work: Q5650510
cites work: Q5339894
cites work: Q5538300
cites work: Unimodular functions
cites work: On the notion of balance of a signed graph
cites work: Nonlinear Integer Programming
cites work: Facility location: discrete models and local search methods
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: A bibliography for some fundamental problem categories in discrete location science
DOI: 10.1016/J.EJOR.2018.07.045
description: scientific article; zbMATH DE number 6968132