Matroid optimisation problems with nested non-linear monomials in the objective function
From MaRDI portal
Publication:1646569
DOI10.1007/s10107-017-1140-9zbMath1419.90118OpenAlexW2605137997MaRDI QIDQ1646569
Anja Fischer, S. Thomas McCormick, Frank Fischer
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (6)
The Multilinear Polytope for Acyclic Hypergraphs ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs ⋮ Multilinear sets with two monomials and cardinality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial optimization with one quadratic term: spanning trees and forests
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Geometric algorithms and combinatorial optimization.
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- A class of valid inequalities for multilinear 0-1 optimization problems
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complete description for the spanning tree problem with one linearised quadratic term
- Submodular functions and optimization.
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Nonlinear Matroid Optimization and Experimental Design
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Convex Matroid Optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Computation in multicriteria matroid optimization
- Optimum branchings
- Comments on bases in dependence structures
- Matroids and the greedy algorithm
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- A Polyhedral Study of Binary Polynomial Programs
- On The Boolean Quadric Forest Polytope
This page was built for publication: Matroid optimisation problems with nested non-linear monomials in the objective function
