Results 41 to 50 of about 743,783 (286)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
Solving Competitive Location Problems with Social Media Data Based on Customers’ Local Sensitivities
ISPRS International Journal of Geo-Information, 2019 Competitive location problems (CLPs) are a crucial business concern. Evaluating customers’ sensitivities to different facility attractions (such as distance and business area) is the premise for solving a CLP. Currently, the development of location-
Wei Jiang +5 more
doaj +1 more source
Discrete Convex Functions on Graphs and Their Algorithmic Applications
, 2017 The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years.
A Bernáth +36 more
core +1 more source
Solving Discrete Ordered Median Problems with Induced Order [PDF]
, 2020 Ordered median functions have been developed to model flexible discrete location problems. A weight is associated to the distance from a customer to its closest facility, depending on the position of that distance relative to the distances of all the ...
Domínguez-Merino, Enrique +1 more
core
A quadtree-based allocation method for a class of large discrete Euclidean location problems: large location problems [PDF]
, 2015 A special data compression approach using a quadtree-based method is proposed for allocating very large demand points to their nearest facilities while eliminating aggregation error.
Irawan, Chandra A., Salhi, Said
core +2 more sources
Single-facility huff location problems on networks [PDF]
Annals of Operations Research, 2013 Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination.
Nogales Gómez, Amaya +3 more
openaire +6 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
On a class of intersection graphs [PDF]
, 2013 Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs.
Baïou, Mourad +3 more
core
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
LP-Based Algorithms for Capacitated Facility Location
, 2014 Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem.
An, Hyung-Chan +2 more
core +1 more source