Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
Computer Science Journal of Moldova, 2005 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
A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]
, 2010 AMS Subj. Classification: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems
Milanović, Marija
core
Optimization applications of Goldbach's conjecture. [PDF]
Heliyon, 2023 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]
Pattern Recognit Lett, 2022 Gopalakrishnan S +4 more
europepmc +1 more source
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
Forum of Mathematics, SigmaSchubert 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]
Math Program, 2022 Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
Matroid bases with cardinality constraints on the intersection. [PDF]
Math Program, 2022 Lendl S, Peis B, Timmermans V.
europepmc +1 more source
A technique for obtaining true approximations for k-center with covering constraints. [PDF]
Math Program, 2022 Anegg G +3 more
europepmc +1 more source
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
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