Results 31 to 40 of about 105 (99)

An optimal decision making model for supporting week hospital management

open access: yes, 2010
Health care services, Week hospital, Patient scheduling, Decision making problem, Mathematical programming, 90B35, 90C10,
Marco Cerinic   +11 more
core   +1 more source

A Novel Topical Emollient Plus for Canine Atopic Dermatitis: A Clinical Trial Assessing Efficacy and User Acceptance

open access: yesVeterinary Dermatology, Volume 37, Issue 2, Page 293-305, April 2026.
Background: Canine atopic dermatitis (cAD) is a common, chronic skin condition characterised by epidermal barrier dysfunction, immune dysregulation and cutaneous dysbiosis. While “emollient plus” formulations are widely used in human atopic dermatitis, their role in cAD remains underexplored. Hypothesis/Objectives: To evaluate the clinical efficacy and
Beatriz Fernandes   +8 more
wiley   +1 more source

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

Exact Resolving Domination Numbers of Wheel‐Derived Graphs With an ILP Formulation

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.
Let G = (V, E) be a simple, connected graph, and let d(a, g) denote the shortest distance between vertices a and g. An ordered subset R of V, with |R| = k and k∈N, is known as a resolving set if, for m ≠ c, ∃t ∈ R such that d(m, t) ≠ d(c, t), ∀m, c ∈ V–R. The distance code representation for b ∈ V − R w.r.t.
M. Valentina Gladia   +3 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

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

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

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

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

Integer decomposition for polyhedra defined by nearly totally unimodular matrices [PDF]

open access: yes, 2005
. We call a matrix $A$ nearly totally unimodular if it can be obtained from a totally unimodular matrix $\tilde{A}$ by adding to each row of $\tilde{A}$ an integer multiple of some fixed row $a^{\transp}$ of $\tilde{A}$.
Gijswijt, D.C., Gijswijt, D. (Dion)
core   +1 more source

Home - About - Disclaimer - Privacy