Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628): Difference between revisions

Latest revision as of 19:27, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems	scientific article

Statements

instance of

scholarly article

0 references

title

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (English)

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

14 November 2022

0 references

zbMATH Keywords

submodular maximization

0 references

branch-and-cut

0 references

Benders decomposition

0 references

stochastic maximal covering location problems

0 references

influence maximization

0 references

describes a project that uses

BARON

0 references

Knapsack

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-022-01884-7

0 references

cites work

Competitive facility location model with concave demand

0 references

Maximizing a class of submodular utility functions

0 references

Submodular function minimization and polarity

0 references

Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

0 references

Benders decomposition for very large scale partial set covering and maximal covering location problems

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

Benchmarking optimization software with performance profiles.

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

Q5684698

0 references

Maximizing Non-monotone Submodular Functions

0 references

Benders decomposition without separability: a computational study for capacitated facility location problems

0 references

Solving mixed integer nonlinear programs by outer approximation

0 references

Generalized Benders decomposition

0 references

Large-scale influence maximization via maximal covering location

0 references

Clique is hard to approximate within \(n^{1-\epsilon}\)

0 references

Q4255028

0 references

Q2941641

0 references

On a discrete nonlinear and nonseparable knapsack problem

0 references

Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution

0 references

Combinatorial auctions with decreasing marginal utilities

0 references

Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness

0 references

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

0 references

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

0 references

Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function

0 references

Q4040221

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

Solving the maximal covering location problem with heuristic concentration

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Sequence Independent Lifting for the Set of Submodular Maximization Problem

0 references

A note on maximizing a submodular set function subject to a knapsack constraint

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

A two-stage stochastic programming approach for influence maximization in social networks

0 references

Maximizing expected utility over a knapsack constraint

0 references

Maximizing a class of submodular utility functions with constraints

0 references

Identifiers

zbMATH Open document ID

1506.90245

0 references

DOI

10.1007/s10107-022-01884-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2097628

@@ Property / cites work @@
+Competitive facility location model with concave demand
+Normal rank
@@ Property / cites work @@
+Maximizing a class of submodular utility functions
+Normal rank
@@ Property / cites work @@
+Submodular function minimization and polarity
@@ Property / cites work: Submodular function minimization and polarity / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
+Normal rank
@@ Property / cites work @@
+Benders decomposition for very large scale partial set covering and maximal covering location problems
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+An outer-approximation algorithm for a class of mixed-integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Non-monotone Submodular Functions
@@ Property / cites work: Maximizing Non-monotone Submodular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Benders decomposition without separability: a computational study for capacitated facility location problems
+Normal rank
@@ Property / cites work @@
+Solving mixed integer nonlinear programs by outer approximation
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Large-scale influence maximization via maximal covering location
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4255028
@@ Property / cites work: Q4255028 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+On a discrete nonlinear and nonseparable knapsack problem
+Normal rank
@@ Property / cites work @@
+Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
+Normal rank
@@ Property / cites work @@
+Combinatorial auctions with decreasing marginal utilities
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
+Normal rank
@@ Property / cites work @@
+Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Solving the maximal covering location problem with heuristic concentration
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Sequence Independent Lifting for the Set of Submodular Maximization Problem
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+A polyhedral branch-and-cut approach to global optimization
+Normal rank
@@ Property / cites work @@
+A two-stage stochastic programming approach for influence maximization in social networks
+Normal rank
@@ Property / cites work @@
+Maximizing expected utility over a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Maximizing a class of submodular utility functions with constraints
+Normal rank