Matroid optimization problems with monotone monomials in the objective
From MaRDI portal
Publication:2064281
DOI10.1016/j.dam.2020.04.004zbMath1483.90105OpenAlexW3019550124MaRDI QIDQ2064281
Frank Fischer, Anja Fischer, S. Thomas McCormick
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.004
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Solving the quadratic minimum spanning tree problem
- Combinatorial optimization with one quadratic term: spanning trees and forests
- An extended approach for lifting clique tree inequalities
- Pseudo-Boolean optimization
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A survey for the quadratic assignment problem
- PANDA: a software for polyhedral transformations
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Geometric algorithms and combinatorial optimization.
- Boolean polynomials and set functions
- Cardinality constrained Boolean quadratic polytope
- Matroid optimisation problems with nested non-linear monomials in the objective function
- On decomposability of multilinear sets
- 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.
- Berge-acyclic multilinear 0-1 optimization problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polyhedral approach for a constrained quadratic 0-1 problem
- The symmetric quadratic traveling salesman problem
- Complete description for the spanning tree problem with one linearised quadratic term
- Submodular functions and optimization.
- Convex Relaxations and Integrality Gaps
- Integer Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear Matroid Optimization and Experimental Design
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- 50 Years of Integer Programming 1958-2008
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex Matroid Optimization
- The Multilinear Polytope for Acyclic Hypergraphs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
- Computation in multicriteria matroid optimization
- 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 Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Polyhedral Study of Binary Polynomial Programs
This page was built for publication: Matroid optimization problems with monotone monomials in the objective
