Results 51 to 60 of about 887,365 (205)

New performance guarantees for the greedy maximization of submodular set functions [PDF]

Optimization Letters, 2016
We present new tight performance guarantees for the greedy maximization of nondecreasing submodular set functions. Our main result first provides a performance guarantee in terms of the overlap of the optimal and greedy solutions. As a consequence we improve performance guarantees of Nemhauser, Wolsey and Fisher (1978) and Conforti and Cornu jols ...
Moilanen Atte, Laitila Jussi
openaire   +3 more sources

Cache Assignment for a Flexible Mobile User in Wireless Heterogeneous Networks [PDF]

AUT Journal of Electrical Engineering
With the proliferation of smart mobile devices, there is an ever-increasing demand for multimedia content. To avoid congestion in backhaul links, mobile edge caching is a promising solution that can reduce delivery delays and improve users' quality of ...
Mohammad Hossein Amerimehr, Parisa Eslami, Nahid Amani, sara Efazati   +3 more
doaj   +1 more source

Reconsidering Volume‐Based Drug Procurement Policy: The Consequences of Manufacturers' Optimal Production Planning and Breach Strategies

Naval Research Logistics (NRL), EarlyView.
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

Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization

, 2015
We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ...
Krause, Andreas, Singla, Adish, Tschiatschek, Sebastian   +2 more
core   +1 more source

The Weak Core, Partition‐Based Universal Stability, and Their Risk Associations Through A Partial Order

Naval Research Logistics (NRL), EarlyView.
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

Resource redeployment as an entry advantage in resource‐poor settings

Strategic Management Journal, EarlyView.
Abstract Research Summary Scarcity of productive factors poses a challenge for firms entering underdeveloped regions. We theorize that incumbent firms can overcome scarcity of skilled human capital in local labor markets by redeploying workers from existing units.
Jasmina Chauvin, Carlos Inoue, Christopher Poliquin   +2 more
wiley   +1 more source

Set Function Optimization

Journal of the Operations Research Society of China, 2018
This article is an introduction to recent development of optimization theory on set functions, the nonsubmodular optimization, which contains two interesting results, DS (difference of submodular) functions decomposition and sandwich theorem, together ...
Weili Wu, Zhao Zhang, D. Du
semanticscholar   +1 more source

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem

Theoretical Computer Science, 2020
This paper presents a bicriteria approximation algorithm for the minimum submodular cost partial set multi-cover problem (SCPSMC), the goal of which is to find a minimum cost sub-collection of sets to fully cover q percentage of total profit of all ...
Yishuo Shi, Yingli Ran, Zhao Zhang, D. Du   +3 more
semanticscholar   +1 more source

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie, Chuang Liu, Yang Chen, Zi‐Ke Zhang, Xiaoyang Liu, Xiu‐Xiu Zhan   +5 more
wiley   +1 more source

Quantum and classical algorithms for approximate submodular function minimization [PDF]

Quantum information & computation, 2019
Submodular functions are set functions mapping every subset of some ground set of size n into the real numbers and satisfying the diminishing returns property.
Yassine Hamoudi, P. Rebentrost, A. Rosmanis, M. Santha   +3 more
semanticscholar   +1 more source