Results 181 to 190 of about 1,516 (207)
Some of the next articles are maybe not open access.
Centralized Submodular Optimization
2015Submodularity enables efficient approximation of otherwise intractable set optimization problems using simply greedy or local search heuristics, making submodularity a valuable tool in a variety of applications. This chapter gives an overview of submodular optimization algorithms, with emphasis on centralized algorithms for maximizing submodular ...
Andrew Clark +3 more
openaire +1 more source
A Submodular Optimization Problem with Side Constraints
Mathematics of Operations Research, 1996In this paper we consider the general problem of optimizing over the intersection of a submodular base polyhedron and an affine space. An example is the following flow problem defined on a capacitated network: We wish to send a commodity from locations in a producing country to locations in a number of client countries so as to simultaneously maximize
openaire +2 more sources
Submodular optimization for control of prosumer networks
2016 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2016We propose here a control based method for improving the storage placement in a prosumer network where generators and loads are stochastic. The particularity of our approach is to use the energy required for stabilizing the system as a criterion for the optimization of the storage placement.
Nicolas Gensollen +3 more
openaire +1 more source
Adaptive Robust Submodular Optimization and Beyond
2020Constrained submodular maximization has been extensively studied in the recent years. In this paper, we study adaptive robust optimization with nearly submodular structure (ARONSS). Our objective is to randomly select a subset of items that maximizes the worst case value of several reward functions simultaneously. Our work differs from existing studies
Shaojie Tang 0001, Jing Yuan 0002
openaire +1 more source
On linear, fractional, and submodular optimization
2023In this thesis, we study four fundamental problems in the theory of optimization. 1. In fractional optimization, we are interested in minimizing a ratio of two functions over some domain. A well-known technique for solving this problem is the Newton– Dinkelbach method.
openaire +1 more source
A Test Score-Based Approach to Stochastic Submodular Optimization
Management Science, 2021Shreyas Sekar, Milan Vojnović
exaly
Consistent Online Optimization: Convex and Submodular.
2019ISSN:2640 ...
Karimi Jaghargh, Mohammad R. +3 more
openaire +2 more sources
Corrections to “Rigid Network Design Via Submodular Set Function Optimization”
IEEE Transactions on Network Science and Engineering, 2020Iman Shames, Tyler Summers
exaly
Risk-Aware Submodular Optimization for Multirobot Coordination
IEEE Transactions on Robotics, 2022Lifeng Zhou, Pratap Tokekar
exaly