Results 61 to 70 of about 5,397,625 (216)
Fast and exact search for the partition with minimal information loss. [PDF]
PLoS ONE, 2018 In analysis of multi-component complex systems, such as neural systems, identifying groups of units that share similar functionality will aid understanding of the underlying structures of the system.
Shohei Hidaka, Masafumi Oizumi
doaj +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 +2 more
wiley +1 more source
Planning with Submodular Objective Functions
CoRR, 2020 We study planning with submodular objective functions, where instead of maximizing the cumulative reward, the goal is to maximize the objective value induced by a submodular function. Our framework subsumes standard planning and submodular maximization with cardinality constraints as special cases, and thus many practical applications can be naturally ...
Ruosong Wang +4 more
openaire +2 more sources
Submodular Function Maximization for Group Elevator Scheduling
, 2017 We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function.
Raghunathan, Arvind +2 more
core +1 more source
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions [PDF]
, 2022 As evolutionary algorithms (EAs) are general-purpose optimization algorithms, recent theoretical studies have tried to analyze their performance for solving general problem classes, with the goal of providing a general theoretical explanation of the ...
Qian, Chao
core
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
International Journal of Distributed Sensor Networks, 2021 In this article, we consider the problem of optimally selecting a subset of transmitters from a transmitter set available to a multiple-input and multiple-output radar network.
Chenggang Wang +3 more
doaj +1 more source
Assessing second‐price auctions for parcel exchanges in last‐mile logistics
International Transactions in Operational Research, Volume 34, Issue 2, Page 1040-1071, March 2027.Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley +1 more source
Decomposable submodular function minimization: discrete and continuous
, 2017 This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using ...
Nguyen, Huy +2 more
core +5 more sources
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