Results 261 to 270 of about 29,524 (312)

Surfaceome Reprogramming of Stemsomes Promotes Lung Cancer Targeting via Potentiated Receptor–Ligand Interactions

Advanced Science, EarlyView.
This study presents a surfaceome‐reprogramming strategy for mutation‐independent lung cancer therapy by repurposing dexamethasone to prime mesenchymal stem cell‐derived nanovesicles. The engineered vesicles leverage multi‐valent interactions mediated by upregulated adhesion proteins, EPHA2, and NOTCH3.
Geunhye Kim, In Ah Kwon, Bo Seop Jeong, Hyo Seon Kim, Joo‐Hwan Park, Sung Jean Park, Sang‐Rae Lee, Youngki Lee, Dongwoo Khang   +8 more
wiley   +1 more source

Targeting DNGR‐1 with Fangchinoline Elevates Dendritic Cell Antigen Cross‐Presentation‐Mediated Antitumor Immunity in Melanoma

Advanced Science, EarlyView.
Fangchinoline is identified as a small‐molecule DNGR‐1 modulator that enhances dendritic‐cell cross‐presentation of tumor antigens. By engaging DNGR‐1 and activating Syk–Nox2 signaling, it promotes phagosomal ROS, antigen escape, MHC‐I presentation, and CD8+ T‐cell priming, thereby strengthening antitumor immunity and sensitizing tumors to PD‐1 ...
Yuan Liao, Zhenyang Ren, Jing Zhou, He Luo, Yuling Li, Dan Chen, Yuxiao Jiang, Canzhe Li, Mengyi Zheng, Anqi Li, Yao Wang, Yang Zhang, Dingye Wang, Yanjun Jiang, Jiangyong Gu, Biaoyan Du, Yafei Shi, Fang Liu, Jianyong Xiao, Kun Wang   +19 more
wiley   +1 more source

Single‐Cell Reveal GALNT7‐Dependent Ferroptosis Suppression as a Mechanism of Immunotherapy Resistance in Non‐Small Cell Lung Cancer

Advanced Science, EarlyView.
Integrated clinical and mechanistic analyses identify GALNT7 as a ferroptosis‐suppressive regulator associated with immunotherapy resistance in non‐small cell lung cancer. GALNT7 depletion promotes lipid peroxidation, mitochondrial dysfunction, and ferroptosis, enhances CD8+ T‐cell activation and IFN‐γ production, and sensitizes tumors to PD‐1 blockade,
Jiadi Gan, Qian Zheng, Deng Liu, Ruichao Nie, Menglin Yao, Xiaolong Tang, Renjie Xu, Jinghong Xian, Wenjun Meng, Wenxin Luo, Dan Liu, Guiyi Ji   +11 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A guide to vehicle routing heuristics

Journal of the Operational Research Society, 2002
Summary: Several of the most important classical and modern heuristics for the vehicle routing problem are summarized and compared using four criteria: accuracy, speed, simplicity and flexibility. Computational results are reported.
Michel Gendreau, Gilbert Laporte, Frédéric Semet   +2 more
exaly   +2 more sources

Exact Algorithms for the Clustered Vehicle Routing Problem [PDF]

Operations Research, 2014
This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters.
Maria Battarra, Günes Erdogan, Daniele Vigo   +2 more
exaly   +2 more sources

A toolkit for vehicle routing

Systems Integration '90. Proceedings of the First International Conference on Systems Integration, 2002
A general methodology for solving variations and generalizations of the vehicle routing problem (VRP) is discussed. A notation for specifying and solving a wide variety of such problems is described. The notation has two parts: a static graph-theoretic structure called a hierarchical constraint graph (HCG) and a control structure called a policy.
Bruce MacLeod, Robert Moll
openaire   +1 more source

Vehicle Routing with Time Windows

Operations Research, 1987
In vehicle routing problems with time windows, a fixed fleet of vehicles of limited capacity is available at a depot to serve a set of clients with given demands. Each client must be visited within a given time window. We describe a branch-and-bound method that minimizes the total route length, and present some computational results.
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, Harry W. J. M. Trienekens   +2 more
openaire   +1 more source

Capacitated Vehicle Routing on Trees

Operations Research, 1991
T = (V, E) is a tree with nonnegative weights associated with each of its vertices. A fleet of vehicles of capacity Q is located at the depot represented by vertex v1. The Capacitated Vehicle Routing Problem on Trees (TCVRP) consists of determining vehicle collection routes starting and ending at the depot such that: the weight associated with any ...
Labbé, Martine, Laporte, Gilbert, Mercure, Hélène   +2 more
openaire   +3 more sources

Green Vehicle Routing

2016
Green vehicle routing is a branch of green logistics which refers to vehicle routing problems where externalities of using vehicles, such as carbon dioxide-equivalents emissions, are explicitly taken into account so that they are reduced through better planning. This chapter presents an overview of some of the recent developments in the area, including
Bektaş, Tolga, Demir, Emrah, Laporte, Gilbert   +2 more
openaire   +2 more sources

The rendezvous vehicle routing problem

Optimization Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce L. Golden, Eric Oden, S. Raghavan 0001   +2 more
openaire   +1 more source