On Polyhedral Approximations of Polytopes for Learning Bayesian Networks
, 2013 The motivation for this paper is the geometric approach to statistical learning Bayesian network (BN) structures. We review three vector encodings of BN structures. The first one has been used by Jaakkola et al. (9) and also by Cussens (4), the other two
M. Studený, D. Haws
semanticscholar +1 more source
Tropical Determinant of Integer Doubly-Stochastic Matrices [PDF]
, 2010 Let D(m,n) be the set of all the integer points in the m-dilate of the Birkhoff polytope of doubly-stochastic n by n matrices. In this paper we find the sharp upper bound on the tropical determinant over the set D(m,n).
Birkhoff +9 more
core +3 more sources
The efficiency of an algorithm of integer programming: a probabilistic analysis
, 1980 A simple algorithm for solving the knapsack problem is shown to lead to examining, on the average, around e2 vectors out of 2". Most optimization methods can be considered as devices for reducing the number of possible solutions that need to be examined ...
V. Lifschitz
semanticscholar +1 more source
Nonnegative definite hermitian matrices with increasing principal minors
, 2013 A nonzero nonnegative definite hermitian m by m matrix A has increasing principal minors if the value of each principle minor of A is not less than the value each of its subminors. For $m>1$ we show $A$ has increasing principal minors if and only if $A^{-
Friedland, Shmuel
core +1 more source
On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria [PDF]
Computer Science Journal of Moldova, 2004 We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the ...
Vladimir A. Emelichev +2 more
doaj
Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics [PDF]
Computer Science Journal of Moldova, 2005 In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data's perturbations in the
Vladimir A. Emelichev +2 more
doaj
On Solving Travelling Salesman Problem with Vertex Requisitions
, 2017 We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev, Anton, Kovalenko, Yulia
core +2 more sources
Advances in Industrial and Manufacturing Engineering, 2021 The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum.
Ravi Vishwakarma, P.L. Powar
doaj
Hair fragility (trichorrhexis nodosa) in alopecic Pomeranian dogs
Veterinary Dermatology, Volume 36, Issue 1, Page 64-73, February 2025.Background – Alopecia associated with hair cycle arrest (HCA, Alopecia X) is well‐recognised in Pomeranian dogs. The authors are unaware of reports of hair fragility in affected dogs. Hypothesis/Objectives – Following the observation of frequent hair shaft abnormalities in alopecic Pomeranians, we hypothesised that hair fragility events would be more ...
Erin Brennan +6 more
wiley +1 more source
On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium) [PDF]
Computer Science Journal of Moldova, 2005 A parametric concept of equilibrium (principle of optimality) in a finite cooperative game in normal form of several players is introduced. This concept is defined by means of the partition of players into coalitions.
Sergey E. Bukhtoyarov +1 more
doaj