Maximizing a class of submodular utility functions with constraints
type: Item
instance of: scholarly article
title: Maximizing a class of submodular utility functions with constraints
zbMATH Open document ID: 1358.90085
author: Jiajin Yu
author: S. Ahmed
published in: Mathematical Programming. Series A. Series B
publication date: 2017-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6696634
zbMATH Keywords: submodularity
zbMATH Keywords: cutting planes
zbMATH Keywords: lifting
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: s10107-016-1033-3
OpenAlex ID: W2413913460
cites work: Competitive facility location model with concave demand
cites work: Maximizing a class of submodular utility functions
cites work: The submodular knapsack polytope
cites work: Approximation algorithms for combinatorial auctions with complement-free bidders
cites work: Benchmarking optimization software with performance profiles.
cites work: Maximizing Non-monotone Submodular Functions
cites work: Sequence independent lifting in mixed integer programming
cites work: Q3244654
cites work: On a discrete nonlinear and nonseparable knapsack problem
cites work: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
cites work: Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
cites work: Q4040221
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
cites work: Maximizing expected utility over a knapsack constraint
DOI: 10.1007/S10107-016-1033-3
Recommended article: Maximizing a class of submodular utility functions
Recommended article: Maximization of constrained non-submodular functions
Recommended article: Maximizing a submodular function with viability constraints
Recommended article: Q4633865
Recommended article: Maximizing a non-decreasing non-submodular function subject to various types of constraints
Recommended article: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Recommended article: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Recommended article: Maximization of \(k\)-submodular function with a matroid constraint
Recommended article: Maximizing Non-monotone Submodular Functions
description: scientific article; zbMATH DE number 6696634