Sequence Independent Lifting for the Set of Submodular Maximization Problem

DOI10.1007/978-3-030-45771-6_29MaRDI QIDQ5041759zbMATH OpenOpenAlexFDO

Authors Xueyu Shi, Oleg A. Prokopyev, 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

zbMATH Keywords

polyhedrasubmodular function maximizationsequence independent multidimensional lifting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Sequence independent lifting for a set of submodular maximization problems
• Sequence independent lifting in mixed integer programming
• Sequence Independent Lifting for Mixed-Integer Programming
• A unifying look at sequence submodularity
• The submodularity of two-stage stochastic maximum-weight independent set problems
• On sequential heuristic methods for the maximum independent set problem
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting for mixed knapsack problems with GUB constraints
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Improved deterministic algorithms for non-monotone submodular maximization

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
• Maximizing a class of submodular utility functions
• Maximizing a class of submodular utility functions with constraints
• Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
• Sequence independent lifting for mixed knapsack problems with GUB constraints
• Sequence independent lifting in mixed integer programming
• Submodularity and valid inequalities in capacitated fixed charge networks
• The 0-1 knapsack problem with a single continuous variable

Cited in

(8)

• Special issue: Global solution of integer, stochastic and nonconvex optimization problems
• Sequence independent lifting for a set of submodular maximization problems
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
• Sequence Independent Lifting for Mixed-Integer Programming
• Supermodularity and valid inequalities for quadratic optimization with indicators
• An exact cutting plane method for k-submodular function maximization
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
• Maximizing a class of submodular utility functions

This page was built for publication: Sequence Independent Lifting for the Set of Submodular Maximization Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041759)