Results 31 to 40 of about 102 (96)
EURO 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
Veterinary 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
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
A branch-and-cut algorithm for the target visitation problem
EURO 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
EURO 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
EURO 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]
, 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. +2 more
core +1 more source
Solving the plant location problem on a line by linear programming
Plant location, Linear programming, Integer friendliness, 90B80, 90C10,
Jack Brimberg, Charles ReVelle
core +1 more source
Extreme points of discrete location polyhedra
Extreme point, polyhedron, discrete location, 90C27, 90C10,
Alfredo Marín +2 more
core +1 more source
Discrete location for bundled demand points
Discrete location, Lagrangian relaxation, Valid inequalities, 90B80, 90C10,
Alfredo Marín
core +1 more source