English
Related papers

Related papers: Robust stochastic sorting with interacting criteri…

200 papers

Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also…

Data Structures and Algorithms · Computer Science 2012-04-24 Niraj Kumar Singh , Soubhik Chakraborty

Model explainability is crucial for human users to be able to interpret how a proposed classifier assigns labels to data based on its feature values. We study generalized linear models constructed using sets of feature value rules, which…

Machine Learning · Statistics 2023-11-06 Sanjeeb Dash , Soumyadip Ghosh , Joao Goncalves , Mark S. Squillante

We revisit the classic Cournot model and extend it to a two-echelon supply chain with an upstream supplier who operates under demand uncertainty and multiple downstream retailers who compete over quantity. The supplier's belief about retail…

Computer Science and Game Theory · Computer Science 2021-07-19 Constandina Koki , Stefanos Leonardos , Costis Melolidakis

Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this approach for a class of selection problems. The aim is to choose…

Optimization and Control · Mathematics 2021-02-22 Marc Goerigk , Stefan Lendl , Lasse Wulf

Robust ranking and selection (R&S) is an important and challenging variation of conventional R&S that seeks to select the best alternative among a finite set of alternatives. It captures the common input uncertainty in the simulation model…

Methodology · Statistics 2025-09-23 Yuchen Wan , Zaile Li , L. Jeff Hong

Efficient exact algorithms for Discrete Optimization (DO) rely heavily on strong primal and dual bounds. Relaxed Decision Diagrams (DDs) provide a versatile mechanism for deriving such dual bounds by compactly over-approximating the…

Artificial Intelligence · Computer Science 2025-12-18 Mohsen Nafar , Michael Römer , Lin Xie

One of the most widespread multi-criteria decision-making methods is the Analytic Hierarchy Process (AHP). AHP successfully combines the pairwise comparisons method and the hierarchical approach. It allows the decision-maker to set…

Artificial Intelligence · Computer Science 2022-05-24 Anna Kędzior , Konrad Kułakowski

We consider the problem of learning the preferences of a heterogeneous population by observing choices from an assortment of products, ads, or other offerings. Our observation model takes a form common in assortment planning applications:…

Machine Learning · Statistics 2016-06-09 Nathan Kallus , Madeleine Udell

In this paper we are proposing a new sorting algorithm, List Sort algorithm, is based on the dynamic memory allocation. In this research study we have also shown the comparison of various efficient sorting techniques with List sort. Due the…

Data Structures and Algorithms · Computer Science 2013-10-30 Adarsh Kumar Verma , Prashant Kumar

Thus far, limited research has been performed on resilient supplier selection - a problem that requires simultaneous consideration of a set of numerical and linguistic evaluation criteria, which are substantially different from traditional…

Artificial Intelligence · Computer Science 2019-04-09 Dizuo Jiang , Md Mahmudul Hassan , Tasnim Ibn Faiz , Md. Noor-E-Alam

Limited by cognitive abilities, decision-makers (DMs) may struggle to evaluate decision alternatives based on all criteria in multiple criteria decision-making problems. This paper proposes an embedded criteria selection method derived from…

Optimization and Control · Mathematics 2025-06-10 Kun Zhou , Zaiwu Gong , Guo Wei , Roman Slowinski

Multi-behavior recommendation faces a critical challenge in practice: auxiliary behaviors (e.g., clicks, carts) are often noisy, weakly correlated, or semantically misaligned with the target behavior (e.g., purchase), which leads to biased…

Information Retrieval · Computer Science 2026-01-22 Miaomiao Cai , Zhijie Zhang , Junfeng Fang , Zhiyong Cheng , Xiang Wang , Meng Wang

We consider a multi-stage stochastic lot-sizing problem with service level constraints and supplier-driven product substitution. A firm has multiple products and it has the option to meet demand from substitutable products at a cost.…

Optimization and Control · Mathematics 2023-01-03 Narges Sereshti , Merve Bodur , James R. Luedtke

We examine a controlled school choice model where students are categorized into different types, and the distribution of these types within a school influences its priority structure. This study provides a general framework that integrates…

Theoretical Economics · Economics 2025-03-25 Minoru Kitahara , Yasunori Okumura

This paper deals with a new design methodology for stratified comparative experiments based on interacting reinforced urn systems. The key idea is to model the interaction between urns for borrowing information across strata and to use it…

In performative stochastic optimization, decisions can influence the distribution of random parameters, rendering the data-generating process itself decision-dependent. In practice, decision-makers rarely have access to the true…

Optimization and Control · Mathematics 2025-10-27 Zhuangzhuang Jia , Yijie Wang , Roy Dong , Grani A. Hanasusanto

Recent developments in the field of computational modeling of fracture have opened up possibilities for designing structures against failure. A special case, called interfacial fracture or delamination, can occur in loaded composite…

Optimization and Control · Mathematics 2022-09-13 Sukhminder Singh , Lukas Pflug , Julia Mergheim , Michael Stingl

The restricted polynomially-tilted pairwise interaction (RPPI) distribution gives a flexible model for compositional data. It is particularly well-suited to situations where some of the marginal distributions of the components of a…

Methodology · Statistics 2023-05-15 Janice L. Scealy , Kassel L. Hingee , John T. Kent , Andrew T. A. Wood

Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…

Data Structures and Algorithms · Computer Science 2018-11-27 Marek Adamczyk , Michał Włodarczyk

Non-dominated sorting is a computational bottleneck in Pareto-based multi-objective evolutionary algorithms (MOEAs) due to the runtime-intensive comparison operations involved in establishing dominance relationships between solution…

Neural and Evolutionary Computing · Computer Science 2022-03-29 Bogdan Burlacu
‹ Prev 1 4 5 6 7 8 10 Next ›