Matroid optimization problems with monotone monomials in the objective
From MaRDI portal
Publication:2064281
Recommendations
- Matroid optimisation problems with nested non-linear monomials in the objective function
- A multiply constrained matroid optimization problem
- A parameterized view on matroid optimization problems
- A Parameterized View on Matroid Optimization Problems
- Parametric monotone function maximization with matroid constraints
- Matroid optimization with generalized constraints
- Convex Matroid Optimization
- Maximizing a monotone submodular function subject to a matroid constraint
- scientific article; zbMATH DE number 4027489
- scientific article; zbMATH DE number 863480
Cites work
- 50 Years of Integer Programming 1958-2008
- A class of valid inequalities for multilinear 0-1 optimization problems
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polyhedral approach for a constrained quadratic 0-1 problem
- A polyhedral study of binary polynomial programs
- A survey for the quadratic assignment problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- An extended approach for lifting clique tree inequalities
- Berge-acyclic multilinear 0-1 optimization problems
- Boolean polynomials and set functions
- Cardinality constrained Boolean quadratic polytope
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Comments on bases in dependence structures
- Complete description for the spanning tree problem with one linearised quadratic term
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
- Computation in multicriteria matroid optimization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex Matroid Optimization
- Convex relaxations and integrality gaps
- 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.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- 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 35513 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3609444 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Integer Programming
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Matroids and the greedy algorithm
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear Matroid Optimization and Experimental Design
- On decomposability of multilinear sets
- PANDA: a software for polyhedral transformations
- Pseudo-Boolean optimization
- Solving the quadratic minimum spanning tree problem
- 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
- The multilinear polytope for acyclic hypergraphs
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- The symmetric quadratic traveling salesman problem
Cited in
(8)- Monotonizing linear programs with up to two nonzeroes per column
- Matroid optimisation problems with nested non-linear monomials in the objective function
- A multiply constrained matroid optimization problem
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Nonlinear Matroid Optimization and Experimental Design
- Matrix-Monotonic Optimization - Part I: Single-Variable Optimization
- Mathematical Foundations of Computer Science 2005
- Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
This page was built for publication: Matroid optimization problems with monotone monomials in the objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064281)
