Results 161 to 170 of about 863,417 (323)
Knowledge Gradient Procedure to Select the Best System Under Pairwise Comparisons
Naval Research Logistics (NRL), EarlyView.ABSTRACT This article considers fixed‐budget ranking and selection (R&S) problems where the performance of alternative designs can only be assessed through pairwise comparisons, a setting encountered in many applications, including player ranking in games, sports tournaments, recommender systems, image‐based search, public choice models such as voting ...
Dongyang Li +4 more
wiley +1 more source
Improved Regression Tree Models Using Generalization Error‐Based Splitting Criteria
Naval Research Logistics (NRL), EarlyView.ABSTRACT Despite the widespread application of machine learning (ML) approaches such as the regression tree (RT) in the field of data‐driven optimization, overfitting may impair the effectiveness of ML models and thus hinder the deployment of ML for decision‐making.
Ying Yang, Shuaian Wang, Gilbert Laporte
wiley +1 more source
Data‐Driven Ranking and Selection With Simultaneous Input Data Collection and Simulation
Naval Research Logistics (NRL), EarlyView.ABSTRACT In this paper, we propose a general and novel formulation of ranking and selection with the existence of streaming input data. The collection of multiple streams of such data may consume different types of resources, and hence can be conducted simultaneously.
Yuhao Wang, Enlu Zhou
wiley +1 more source
On the minimum common integer partition problem [PDF]
, 2008 Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
openalex +1 more source
Minimum‐Peak‐Cost Flows Over Time
Networks, EarlyView.ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska +7 more
wiley +1 more source
Graph labelings and decompositions by partitioning sets of integers [PDF]
, 2010 Jordi Moragas Vilarnau
openalex +1 more source
On the Complexity of the Bilevel Shortest Path Problem
Networks, EarlyView.ABSTRACT We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a subset of the edges of a graph and together aim at building a path between two given vertices, while each of the ...
Dorothee Henke, Lasse Wulf
wiley +1 more source
Adaptive sampling for ecological monitoring using biased data: a stratum‐based approach
Oikos, EarlyView.Indicators of biodiversity change across large extents of geographic, temporal and taxonomic space are frequent products of various types of ecological monitoring and other data collection efforts. Unfortunately, many such indicators are based on data that are highly unlikely to be representative of the intended statistical populations.
Oliver L. Pescott +2 more
wiley +1 more source