Results 51 to 60 of about 10,146,366 (200)
Robust Adaptive Submodular Maximization [PDF]
, 2022 The goal of a sequential decision making problem is to design an interactive policy that adaptively selects a group of items, each selection is based on the feedback from the past, in order to maximize the expected utility of selected items.
Tang, Shaojie
core
Naval Research Logistics (NRL), Volume 73, Issue 5, Page 743-763, August 2026.ABSTRACT This paper examines the impacts of Volume‐Based Procurement (VBP) policies on pharmaceutical supply chains, with a focus on the strategic behaviors of manufacturers. VBP aims to reduce costs and stabilize supplies by centralizing procurement through competition based on volumes and prices.
Nani Zhou, Tong Wang, Guohua Wan
wiley +1 more source
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
CoRR, 2022 Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation algorithms under this general setting where neither the objective function is monotonic nor the feasible set is down ...
Donglei Du +4 more
openaire +2 more sources
Naval Research Logistics (NRL), Volume 73, Issue 5, Page 810-835, August 2026.ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
wiley +1 more source
Prize-collecting set multicovering with submodular pricing
, 2017 International audienceWe consider a ground set E and a submodular function f : 2 E → R acting on it. We first propose a Set Multi-Covering problem in which the value (price) of any S ⊆ E is f (S).
Daniel Porumbel +2 more
core +1 more source
New Query Lower Bounds for Submodular Function Minimization [PDF]
, 2020 We consider submodular function minimization in the oracle model: given black-box access to a submodular set function f:2^[n] → ℝ, find an element of arg min_S {f(S)} using as few queries to f(⋅) as possible. State-of-the-art algorithms succeed with Õ(n²)
Graur, Andrei +4 more
core +1 more source
Active-set Methods for Submodular Minimization Problems [PDF]
, 2017 International audienceWe consider the submodular function minimization (SFM) and the quadratic minimization problemsregularized by the Lov'asz extension of the submodular function.
Sesh Kumar, K. S., Bach, Francis
core +1 more source
On the Supremum of Singleton Ratios in Submodular Functions
MathematicsLet N be a finite set of cardinality n, and let a∈N. A submodular function f on N with f(a)=1 is defined to be a-reduced if, for any decomposition f=g+h into submodular functions, where h does not depend on a, it follows that h is identically zero.
Laszlo Csirmaz
doaj +1 more source
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
International Economic Review, Volume 67, Issue 3, Page 875-891, August 2026.ABSTRACT We examine a two‐stage selling mechanism design problem, where the buyer makes her report and the seller endogenously decides his effort (hidden investment) to generate a possibly better outside offer. The optimal mechanism shows that the seller's effort depends on the reported value of the buyer; a higher value lowers the seller's incentive ...
Xiaogang Che +3 more
wiley +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source