Matroid optimization problems with monotone monomials in the objective
type: Item
instance of: scholarly article
title: Matroid optimization problems with monotone monomials in the objective
zbMATH Open document ID: 1483.90105
author: Anja Fischer
author: Frank Fischer
author: S. Thomas McCormick
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C23
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 7452354
zbMATH Keywords: polynomial 0-1 programming
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: matroids
zbMATH Keywords: complete description
zbMATH Keywords: hierarchy
describes a project that uses: Gurobi
describes a project that uses: JBool
describes a project that uses: MOCHA
describes a project that uses: PANDA
MaRDI profile type: Publication
full work available at URL: j.dam.2020.04.004
OpenAlex ID: W3019550124
cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
cites work: Q3989988
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Nonlinear 0–1 programming: I. Linearization techniques
cites work: Nonlinear Matroid Optimization and Experimental Design
cites work: Pseudo-Boolean optimization
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: Comments on bases in dependence structures
cites work: Berge-acyclic multilinear 0-1 optimization problems
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: Convex Relaxations and Integrality Gaps
cites work: Integer Programming
cites work: Solving the quadratic minimum spanning tree problem
cites work: Q3077976
cites work: A class of valid inequalities for multilinear 0-1 optimization problems
cites work: A Polyhedral Study of Binary Polynomial Programs
cites work: The Multilinear Polytope for Acyclic Hypergraphs
cites work: On decomposability of multilinear sets
cites work: Q5684698
cites work: Matroids and the greedy algorithm
cites work: A polyhedral approach for a constrained quadratic 0-1 problem
cites work: Complete description for the spanning tree problem with one linearised quadratic term
cites work: An extended approach for lifting clique tree inequalities
cites work: Matroid optimisation problems with nested non-linear monomials in the objective function
cites work: The symmetric quadratic traveling salesman problem
cites work: Q3270229
cites work: Submodular functions and optimization.
cites work: Q4198056
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: Q4174517
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: 50 Years of Integer Programming 1958-2008
cites work: Q4537750
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
cites work: Computation in multicriteria matroid optimization
cites work: A survey for the quadratic assignment problem
cites work: PANDA: a software for polyhedral transformations
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Q5292089
cites work: Cardinality constrained Boolean quadratic polytope
cites work: Q4040221
cites work: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
cites work: Convex Matroid Optimization
cites work: Q3135082
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: Boolean polynomials and set functions
cites work: Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Q4247442
cites work: Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
cites work: Q4111952
DOI: 10.1016/J.DAM.2020.04.004

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Matroid optimisation problems with nested non-linear monomials in the objective function
Similarity Score: 0.9581915
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: A multiply constrained matroid optimization problem
Similarity Score: 0.91170526
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: A parameterized view on matroid optimization problems
Similarity Score: 0.91124177
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: A Parameterized View on Matroid Optimization Problems
Similarity Score: 0.91124177
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Parametric monotone function maximization with matroid constraints
Similarity Score: 0.9110352
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Matroid optimization with generalized constraints
Similarity Score: 0.9036354
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Convex Matroid Optimization
Similarity Score: 0.89997065
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Similarity Score: 0.8976613
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Q3768918
Similarity Score: 0.8976026
Recommender Run: Recommender Run 3

Matroid optimization problems with monotone monomials in the objective (Recommended article)
Recommended article: Q4871759
Similarity Score: 0.8971524
Recommender Run: Recommender Run 3