Matroid optimisation problems with nested non-linear monomials in the objective function
type: Item
instance of: scholarly article
title: Matroid optimisation problems with nested non-linear monomials in the objective function
zbMATH Open document ID: 1419.90118
author: Anja Fischer
author: Frank Fischer
author: S. Thomas McCormick
published in: Mathematical Programming. Series A. Series B
publication date: 2018-06-25T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6894015
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: matroid
zbMATH Keywords: matroid polytope
zbMATH Keywords: linearisation
zbMATH Keywords: polynomial optimisation
zbMATH Keywords: separation
describes a project that uses: MOCHA
MaRDI profile type: Publication
full work available at URL: s10107-017-1140-9
OpenAlex ID: W2605137997
cites work: Nonlinear Matroid Optimization and Experimental Design
cites work: Comments on bases in dependence structures
cites work: Combinatorial optimization with one quadratic term: spanning trees and forests
cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
cites work: A class of valid inequalities for multilinear 0-1 optimization problems
cites work: Computation in multicriteria matroid optimization
cites work: A Polyhedral Study of Binary Polynomial Programs
cites work: Optimum branchings
cites work: Q5684698
cites work: Matroids and the greedy algorithm
cites work: Complete description for the spanning tree problem with one linearised quadratic term
cites work: Q3270229
cites work: Submodular functions and optimization.
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: Geometric algorithms and combinatorial optimization.
cites work: An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
cites work: On The Boolean Quadric Forest Polytope
cites work: Q5292089
cites work: Convex Matroid Optimization
cites work: Q3135082
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Q4111952
DOI: 10.1007/S10107-017-1140-9
description: scientific article; zbMATH DE number 6894015