Results 71 to 80 of about 167,714 (331)

Formulations and Metaheuristics for combinatorial optimization problems [PDF]

open access: yes, 2022
Combinatorial optimization problems have been strongly addressed throughout history. Their study involves highly applied problems that must be solved in reasonable times. This doctoral Thesis addresses three Operations Research problems: the first deals with the Traveling Salesman Problem with Pickups and Delivery with Handling cost, which was ...
openaire   +2 more sources

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

open access: yesFEBS 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

Duality between Feature Selection and Data Clustering

open access: yes, 2016
The feature-selection problem is formulated from an information-theoretic perspective. We show that the problem can be efficiently solved by an extension of the recently proposed info-clustering paradigm.
Al-Bashabsheh, Ali   +3 more
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2017
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj   +1 more source

The skills required for transition to university and study in biological sciences: A student perspective

open access: yesFEBS Open Bio, EarlyView.
Bioscience students were asked for their opinions on the value and teaching of skills. 204 responded that teamwork, time management and study skills are necessary to reach University, that scientific writing, research, laboratory and presentation skills are taught effectively during their studies, while other skills are gained inherently through study ...
Janella Borrell, Susan Crennell
wiley   +1 more source

MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION

open access: yesМіжнародний науково-технічний журнал "Проблеми керування та інформатики", 2011
The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets   +2 more
doaj   +1 more source

One size does not fit all: An in vitro evaluation of the effects of bezafibrate and medroxyprogesterone acetate on human SH‐SY5Y and U‐87 MG cancer cells

open access: yesFEBS Open Bio, EarlyView.
Drugs previously repurposed to target blood cancers reduced neuroblastoma and glioblastoma cell growth and viability. However, their levels of anticancer activity were different and their clinical application may be problematic due to side effects at effective doses.
Abhishek Kharawatkar   +4 more
wiley   +1 more source

On the Problem of a Linear Function Localization on Permutations

open access: yesКібернетика та комп'ютерні технології, 2020
Combinatorial optimization problems and methods of their solution have been a subject of numerous studies, since a large number of practical problems are described by combinatorial optimization models.
G.A. Donets, V.I. Biletskyi
doaj   +1 more source

A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading

open access: yesMathematics, 2023
The current air cargo loading plan handles the Air Cargo Palletization Problem (ACPP) and the Aircraft Weight and Balance Problem (WBP) separately, which has an impact on the optimization of the payload and the aircraft’s center of gravity (CG).
Xiangling Zhao, Yun Dong, Lei Zuo
doaj   +1 more source

Home - About - Disclaimer - Privacy