Results 61 to 70 of about 2,699,353 (198)
Two-Stage Submodular Maximization Under Knapsack Problem
Tsinghua Science and TechnologyTwo-stage submodular maximization problem under cardinality constraint has been widely studied in machine learning and combinatorial optimization. In this paper, we consider knapsack constraint.
Zhicheng Liu +3 more
doaj +1 more source
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
Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint
Tsinghua Science and TechnologyWe investigate the problem of maximizing the sum of submodular and supermodular functions under a fairness constraint. This sum function is non-submodular in general. For an offline model, we introduce two approximation algorithms: A greedy algorithm and
Zhenning Zhang +3 more
doaj +1 more source
Towards Minimizing k-Submodular Functions
, 2012 In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.
Anna Huber +3 more
core +1 more source
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
On Constructing Finite, Finitely Subadditive Outer Measures, and Submodularity
International Journal of Mathematics and Mathematical Sciences, 2008 Given a nonempty abstract set 𝑋, and a covering class 𝒞, and a finite, finitely subadditive outer measure 𝜈, we construct an outer measure 𝜈 and investigate conditions for 𝜈 to be submodular. We then consider several other set functions associated with 𝜈
Charles Traina
doaj +1 more source
Extremality of submodular functions
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The Expressive Power of Binary Submodular Functions. [PDF]
, 2008 It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables.
Jeavons, PG +10 more
core +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
Analysis and Augmentation of Human Performance on Telerobotic Search Problems
IEEE Access, 2020 Search is an essential technology for rescue and other mobile robot applications. Many robotic search and rescue systems rely on teleoperation. One of the key problems in search tasks is how to cover the search space efficiently.
Kuo-Shih Tseng, Berenice Mettler
doaj +1 more source