Results 71 to 80 of about 5,397,625 (216)
Greedy Sensor Selection for Weighted Linear Least Squares Estimation Under Correlated Noise
IEEE Access, 2022 Optimization of sensor selection has been studied to monitor complex and large-scale systems with data-driven linear reduced-order modeling. An algorithm for greedy sensor selection is presented under the assumption of correlated noise in the sensor ...
Keigo Yamada +3 more
doaj +1 more source
Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire
Networks, Volume 88, Issue 3, Page 313-330, October 2026.ABSTRACT Local councils across the UK are facing sustained financial pressures, and Household Waste Recycling Centres (HWRCs) are being increasingly considered for closure to reduce expenditure. In 2024, Hampshire County Council, which operates the largest HWRC network in the UK, proposed closing either five or twelve existing sites.
Montree Jaidee +4 more
wiley +1 more source
A Fully Combinatorial Algorithm for Submodular Function Minimization
, 2002 This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function ...
Satoru Iwata, Iwata, Satoru
core +1 more source
Approximation Algorithms for Maximization of k-Submodular Function Under a Matroid Constraint
Tsinghua Science and TechnologyIn this paper, we design a deterministic 1/3-approximation algorithm for the problem of maximizing non-monotone k-submodular function under a matroid constraint.
Yuezhu Liu, Yunjing Sun, Min Li
doaj +1 more source
Security Design Under Common‐Value Competition
Econometrica, Volume 94, Issue 5, Page 1717-1759, September 2026.This paper studies security design by bidders with dispersed information about a common‐value investment opportunity. Among a broad set of securities, bidders offer debt financing—the flattest securities. A first reason is that debt mitigates bidders' exposure to the winner's curse when there are two bidders.
Yue Yuan
wiley +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 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
Extremality of submodular functions
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Metric learning with submodular functions
Neurocomputing, 2020 Abstract Most of the metric learning mainly focuses on using single feature weights with Lp norms, or the pair of features with Mahalanobis distances to learn the similarities between the samples, while ignoring the potential value of higher-order interactions in the feature space.
Jiajun Pan, Hoel Le Capitaine
openaire +5 more sources
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