Results 31 to 40 of about 473 (77)

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

open access: yesEURO Journal on Computational Optimization, 2018
In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases.
SuneLauth Gadegaard   +2 more
doaj   +1 more source

Nonnegative definite hermitian matrices with increasing principal minors

open access: yes, 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 Solving Travelling Salesman Problem with Vertex Requisitions

open access: yes, 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

On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium) [PDF]

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

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

open access: yesEURO Journal on Computational Optimization, 2017
The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila   +3 more
doaj   +1 more source

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

On the Caratheodory rank of polymatroid bases [PDF]

open access: yes, 2010
In this paper we prove that the Carath\'eodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of the ground set.Comment: 7 ...
Gijswijt, Dion, Regts, Guus
core  

The Langevin Approach: a simple stochastic method for complex phenomena

open access: yes, 2015
We describe a simple stochastic method, so-called Langevin approach, which enables one to extract evolution equations of stochastic variables from a set of measurements.
Fuchs, André   +5 more
core   +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

Home - About - Disclaimer - Privacy