Results 71 to 80 of about 9,501,678 (288)

Large neighborhood local search optimization on graphics processing units [PDF]

2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as ``walks through neighborhoods'' where the walks are performed by iterative procedures that allow to move from a solution to another one in the solution space.
Luong, Thé Van, Melab, Nouredine, Talbi, El-Ghazali   +2 more
openaire   +2 more sources

Preoperative circulating tumor cells integrated with imaging analysis for prognostic evaluation in head and neck squamous cell carcinoma

Molecular Oncology, EarlyView.
Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach, Gizem Abaci, Tom Huberty, Axel Lechner, Lukas Käsmann, Jens Ricke, Sophia Stöcklein, Martin Canis, Philipp Baumeister, Marianna Alunni‐Fabbroni   +9 more
wiley   +1 more source

Research on the Integrated Scheduling of Imaging and Data Transmission for Earth Observation Satellites

Algorithms
This study focuses on the integrated scheduling issues of imaging and data transmission for Earth observation satellites, where each target needs to be imaged and transmitted within a feasible time window.
Guanfei Yu, Kunlun Zhang
doaj   +1 more source

Regularized Large Neighborhood Search

Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current solution by locally re-optimizing subsets of its variables. In contrast, most existing approaches for integrating combinatorial optimization layers into neural networks still ...
Vivier-Ardisson, Germain, Demonet, Laurent, Parmentier, Axel, Blondel, Mathieu   +3 more
openaire   +2 more sources

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem [PDF]

INFORMS Journal on Computing, 2002
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n is less than or equal to 25 ...
Ahuja, Ravindra, Jha, Krishna, Orlin, James, Sharma, Dushyant   +3 more
openaire   +2 more sources

Profiling neoadjuvant therapy response in rectal cancer using meta‐analysis of publicly available transcriptomic RNA‐seq datasets

Molecular Oncology, EarlyView.
This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic, Rafael Stroggilos, Mladen Marinkovic, Ana Djuric, Suzana Stojanovic‐Rundic, Radmila Jankovic, Sergi Castellvi‐Bel, Remond J.A. Fijneman, Antonia Vlahou, Jerome Zoidakis, Milena Cavic   +10 more
wiley   +1 more source

Large neighborhood search for route and fleet optimization in frozen food distribution

OPSI
This study develops an optimization model to enhance the distribution efficiency of a frozen food distributor. The company faces operational inefficiencies due to excessive fleet capacity and conventional route assignment methods, which increase travel ...
Jonathan Andrepa Simbolon, Trismi Ristyowati, Apriani Soepardi, Irwan Soejanto, Yuli dwi Astanti, Puryani, Mochammad Chaeron   +6 more
doaj   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

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, Fredrik Orädd, Konstantinos Magkakis, Magnus Andersson   +3 more
wiley   +1 more source

ANALISA PERBANDINGAN METODE SIMULATED ANNEALING DAN LARGE NEIGHBORHOOD SEARCH UNTUK MEMECAHKAN MASALAH LOKASI DAN RUTE KENDARAAN DUA ESELON

Jurnal Manajemen Industri dan Logistik, 2020
Two-echelon location routing problem (2E-LRP) is a problem that considers distribution problem in a two-level / echelon transport system. The first echelon considers trips from a main depot to a set of selected satellite.
Winarno (Universitas Singaperbangsa Karawang), A. A. N. Perwira Redi (Universitas Pertamina)   +1 more
doaj   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

FEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong, Yuhei Hosokawa, Lars Oliver Essen, Manuel Maestre‐Reyna   +3 more
wiley   +1 more source