Submodular maximization and its generalization through an intersection cut lens
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A polyhedral branch-and-cut approach to global optimization
- A polyhedral study of binary polynomial programs
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of mixed integer linear sets based on lattice point free convex sets
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Concave extensions for nonlinear 0-1 maximization problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexity Cuts and Cut Search
- Cut-generating functions and S-free sets
- Discrete Newton's algorithm for parametric submodular function minimization
- Discrete convex analysis
- Fractional 0-1 programming and submodularity
- Integer Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Intersection Disjunctions for Reverse Convex Sets
- Intersection cuts for factorable MINLP
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lectures on convex optimization
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Maximal lattice-free convex sets in linear subspaces
- Maximal quadratic-free sets
- Maximizing a class of submodular utility functions
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Monoidal strengthening and unique lifting in MIQCPs
- Multilinear sets with two monomials and cardinality constraints
- Nonunique lifting of integer variables in minimal inequalities
- On minimal valid inequalities for mixed integer conic programs
- On optimization properties of functions, with a concave minorant
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- On the safety of Gomory cut generators
- On the use of intersection cuts for bilevel optimization
- Outer approximation with conic certificates for mixed-integer convex problems
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Relaxations of mixed integer sets from lattice-free polyhedra
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some polyhedra related to combinatorial problems
- Spherical cuts for integer programming problems
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Submodular function minimization and polarity
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Submodularity and randomized rounding techniques for optimal experimental design
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Sufficiency of cut-generating functions
- Tensor Decompositions and Applications
- The group-theoretic approach in mixed integer programming
- The multilinear polytope for acyclic hypergraphs
- Two-term disjunctions on the second-order cone
- ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
This page was built for publication: Submodular maximization and its generalization through an intersection cut lens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988549)
