Search
Search Results
-
Sublinear Algorithms in T-Interval Dynamic Networks
We consider standard T - interval dynamic networks , under the synchronous timing model and the broadcast CONGEST model. In a T - interval dynamic network ,...
-
Rogers–Ramanujan type identities involving double, triple and quadruple sums
We prove a number of new Rogers–Ramanujan type identities involving double, triple and quadruple sums. They were discovered after an extensive search...
-
Positivity and convexity in incomplete cooperative games
Incomplete cooperative games generalize the classical model of cooperative games by omitting the values of some of the coalitions. This allows for...
-
Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
The multi-state flow network (MSFN) serves as a fundamental framework for real-life network-structured systems and various applications. The system...
-
Requirement-driven supplier selection: a multi-criteria QFD-based approach under epistemic and stochastic uncertainties
Supplier selection (SS) has emerged as a critical challenge for companies aiming to enhance the operational management of their supply chains, a task...
-
Queueing-inventory: analytical and simulation modeling and classical and retrial queues and inventory
This is the PREFACE to the Special Issue “Queueing-inventory: analytical and simulation modeling and classical and retrial queues and inventory”. The...
-
-
On the Connected Blocks Polytope
In this paper, we study the connected blocks polytope, which, apart from its own merits, can be seen as the generalization of certain connectivity...
-
Exploring servitization in the supply chain: a review of current research via bibliometric analysis and future study prospects
Servitization, an emerging strategy that combines product and service offerings, is gaining traction among manufacturing firms seeking a competitive...
-
-
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Polynomial commitments schemes are a powerful tool that enables one party to commit to a polynomial p of degree d , and prove that the committed...
-
Structural iterative rounding for generalized k-median problems
This paper considers approximation algorithms for generalized k -median problems. These problems can be informally described as k -median with a...
-
The Price of Active Security in Cryptographic Protocols
We construct the first actively-secure Multi-Party Computation (MPC) protocols with an arbitrary number of parties in the dishonest majority setting,...
-
Covering Array on the Cartesian Product of Hypergraphs
Covering array (CA) on a hypergraph H is a combinatorial object used in interaction testing of a complex system modeled as H . Given a t -uniform...
-
Free disposal hull models of multicomponent technologies
Free disposal hull (FDH) is a nonparametric model of production technology based on the single assumption of free disposability of all inputs and...
-
-
Solutions of the functional difference Toda equation from centered Darboux transformation
By using a particular Darboux transformation which we can call centered Darboux transformation, we construct solutions of the functional difference...