Results 31 to 40 of about 104 (98)

On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint [PDF]

open access: yes, 1999
0–1 program, cover, clique, knapsack constraint, coefficient increase, coefficient reduction, 90C09, 90C10,
Araceli Garín   +5 more
core   +1 more source

Reduction of dimensionality in dynamic programming‐based solution methods for nonlinear integer programming

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 4, Page 811-814, 1988., 1988
This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.
Balasubramanian Ram, A. J. G. Babu
wiley   +1 more source

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

Lagrangean bounds for the optimum communication spanning tree problem

open access: yes, 2010
Network design, Lagrangean relaxation, Heuristics, 90B10, 90B18, 90C10,
Alfredo Marín   +5 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

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

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

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

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

Home - About - Disclaimer - Privacy