Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Publication:2097628
DOI10.1007/S10107-022-01884-7zbMath1506.90245OpenAlexW4307574231MaRDI QIDQ2097628
Fabio Furini, Stefano Coniglio, Ivana Ljubić
Publication date: 14 November 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01884-7
branch-and-cutBenders decompositioninfluence maximizationsubmodular maximizationstochastic maximal covering location problems
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Competitive facility location model with concave demand
- On a discrete nonlinear and nonseparable knapsack problem
- Solving mixed integer nonlinear programs by outer approximation
- A note on maximizing a submodular set function subject to a knapsack constraint
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- A two-stage stochastic programming approach for influence maximization in social networks
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- A polyhedral branch-and-cut approach to global optimization
- Maximizing expected utility over a knapsack constraint
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Large-scale influence maximization via maximal covering location
- Submodular function minimization and polarity
- Solving the maximal covering location problem with heuristic concentration
- Combinatorial auctions with decreasing marginal utilities
- Generalized Benders decomposition
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
- Maximizing Non-monotone Submodular Functions
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- Benchmarking optimization software with performance profiles.
This page was built for publication: Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
