Sequence Independent Lifting for the Set of Submodular Maximization Problem
From MaRDI portal
Publication:5041759
DOI10.1007/978-3-030-45771-6_29zbMath1503.90119OpenAlexW3017037005MaRDI QIDQ5041759
Oleg A. Prokopyev, Xueyu Shi, Bo Zeng
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_29
Related Items (6)
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ An exact cutting plane method for \(k\)-submodular function maximization ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ Sequence independent lifting for a set of submodular maximization problems
Cites Work
- Unnamed Item
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Submodularity and valid inequalities in capacitated fixed charge networks
- The 0-1 knapsack problem with a single continuous variable
- Sequence independent lifting in mixed integer programming
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
This page was built for publication: Sequence Independent Lifting for the Set of Submodular Maximization Problem
