Matroid optimisation problems with nested non-linear monomials in the objective function

DOI10.1007/S10107-017-1140-9MaRDI QIDQ1646569zbMATH OpenOpenAlexFDO

Authors Anja Fischer, Frank Fischer, S. Thomas McCormick

Publication date 25 June 2018

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-017-1140-9

zbMATH Keywords

linearisationpolyhedral combinatoricsmatroidseparationmatroid polytopepolynomial optimisation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Matroid optimization problems with monotone monomials in the objective
• Nonlinear Matroid Optimization and Experimental Design
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• On matroids with multiple objectives

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3152649 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A class of valid inequalities for multilinear 0-1 optimization problems
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A polyhedral study of binary polynomial programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• Combinatorial optimization with one quadratic term: spanning trees and forests
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Comments on bases in dependence structures
• Complete description for the spanning tree problem with one linearised quadratic term
• Computation in multicriteria matroid optimization
• Convex Matroid Optimization
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
• Geometric algorithms and combinatorial optimization.
• Matroids and the greedy algorithm
• Nonlinear Matroid Optimization and Experimental Design
• On The Boolean Quadric Forest Polytope
• Optimum branchings
• Submodular function minimization
• Submodular functions and 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

Cited in

(8)

• Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
• Berge-acyclic multilinear 0-1 optimization problems
• Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
• 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
• Nonlinear Matroid Optimization and Experimental Design
• Multilinear sets with two monomials and cardinality constraints

Describes a project that uses

Uses Software

• MOCHA

This page was built for publication: Matroid optimisation problems with nested non-linear monomials in the objective function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646569)