Results 51 to 60 of about 737 (80)
Core group placement: allocation and provisioning of heterogeneous resources
We present a theoretical and empirical study on a recently introduced combinatorial optimization problem, namely core group placement problem. The problem arises from real-world business requirements as part of resource allocation in cloud management. In
Serdar Kadıoğlu
doaj +1 more source
Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Biró, Péter, Klijn, Flip
core
Nonuniform random geometric graphs with location-dependent radii
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density function on ...
Iyer, Srikanth K., Thacker, Debleena
core +1 more source
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
doaj
Optimization applications of Goldbach's conjecture. [PDF]
Lin BMT, Lin SM, Shyu SJ.
europepmc +1 more source
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Gopalakrishnan S +4 more
europepmc +1 more source
Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
Schubert Vanishing is a problem of deciding whether Schubert coefficients are zero. Until this work it was open whether this problem is in the polynomial hierarchy ${{\mathsf {PH}}}$ .
Igor Pak, Colleen Robichaux
doaj +1 more source
Continuous facility location on graphs. [PDF]
Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
Matroid bases with cardinality constraints on the intersection. [PDF]
Lendl S, Peis B, Timmermans V.
europepmc +1 more source

