Results 31 to 40 of about 89 (63)

Comparative efficacy of selenoureido carbonic anhydrase inhibitors and azole antifungal drugs against clinical isolates of Malassezia pachydermatis

open access: yesVeterinary Dermatology, Volume 36, Issue 3, Page 302-313, June 2025.
Background – Malassezia pachydermatis (MP) is implicated in severe dermatitis and otitis externa (OE) of companion animals and recently gained attention for its increasing resistance to azole compounds. For this reason, developing novel therapeutic strategies is of great interest. In a previous work, we used reference yeast isolates to evaluate several
Costanza Spadini   +11 more
wiley   +1 more source

Hair fragility (trichorrhexis nodosa) in alopecic Pomeranian dogs

open access: yesVeterinary 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

A branch-and-cut algorithm for the target visitation problem

open access: yesEURO Journal on Computational Optimization, 2019
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj   +1 more source

Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective

open access: yesEURO Journal on Computational Optimization, 2018
Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues   +2 more
doaj   +1 more source

Improving strong branching by domain propagation

open access: yesEURO Journal on Computational Optimization, 2014
One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on.
Gerald Gamrath
doaj   +1 more source

On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles [PDF]

open access: yesComputer Science Journal of Moldova, 2005
A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic ...
Sergey E. Bukhtoyarov   +1 more
doaj  

Covering Convex Bodies and the Closest Vector Problem. [PDF]

open access: yesDiscrete Comput Geom, 2022
Naszódi M, Venzin M.
europepmc   +1 more source

Home - About - Disclaimer - Privacy