Impact-driven process model repair
The abundance of event data in today's information systems makes it possible to “confront”
process models with the actual observed behavior. Process mining techniques use event …
process models with the actual observed behavior. Process mining techniques use event …
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
The resource allocation problem (RAP) determines a solution to optimally allocate limited
resources to several activities or tasks. In this study, we propose a novel resource allocation …
resources to several activities or tasks. In this study, we propose a novel resource allocation …
Finding the Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty
The mean-standard deviation shortest path problem (MSDSPP) incorporates the travel time
variability into the routing optimization. The idea is that the decision-maker wants to …
variability into the routing optimization. The idea is that the decision-maker wants to …
[PDF][PDF] A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing
S Li, Y Zhang, W Sun, J Liu - International Journal of Applied …, 2023 - intapi.sciendo.com
It is a hot topic to investigate resource allocation in fog computing. However, currently
resource allocation in fog computing mostly supports only fixed resources, that is, the …
resource allocation in fog computing mostly supports only fixed resources, that is, the …
[PDF][PDF] Group decision making for selection of k-best alternatives
D Borissova - Comptes rendus de l'Academie bulgare des …, 2016 - ipdss.iict.bas.bg
The paper describes an approach for determination of k-best alternatives via group decision
making. The aim is to reduce a given set of alternatives to k-best ones to be considered later …
making. The aim is to reduce a given set of alternatives to k-best ones to be considered later …
Exploring K-best solutions to enrich network design decision-making
In this paper, we explore alternative solutions to the Capacitated Fixed Charge Facility
Location problem (CFCFL) that usually arises in Supply Chain Network Design problems …
Location problem (CFCFL) that usually arises in Supply Chain Network Design problems …
Improving Prototype Intelligent Tactical Board for Rugby Sevens
K Yashiro, S Hirose, Y Nakada - 2024 Joint 13th International …, 2024 - ieeexplore.ieee.org
In the last decade, advanced tactical understanding has become increasingly necessary for
players and coaches in rugby, as has been the case in other team sports. Against this …
players and coaches in rugby, as has been the case in other team sports. Against this …
[PDF][PDF] A Branch-and-Price Algorithm for Bin Packing Problem
M Ataei - 2015 - yorkspace.library.yorku.ca
Bin Packing Problem examines the minimum number of identical bins needed to pack a set
of items of various sizes. Employing branch-and-bound and column generation usually …
of items of various sizes. Employing branch-and-bound and column generation usually …
Finding multiplies solutions for non-linear integer programming
JMJ Cobano, JMU Enríquez - Electronic Notes in Discrete Mathematics, 2018 - Elsevier
Finding multiplies solutions for non-linear integer programming Page 1 Finding multiplies
solutions for non-linear integer programming José Manuel Jiménez Cobano2 Instituto de …
solutions for non-linear integer programming José Manuel Jiménez Cobano2 Instituto de …
[PDF][PDF] COMPUTATIONAL PERFORMANCE STUDY OF SOME HEURISTICS FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
AE OLUWATOBI - 2021 - eprints.lmu.edu.ng
ABSTRACT The Optimization Problem of solving complex, mostly impracticable problems
with limited resources remains a research conundrum which has necessitated enormous …
with limited resources remains a research conundrum which has necessitated enormous …