Results 131 to 140 of about 75,020 (311)

Exact and heuristic algorithms for the domination problem

open access: yesEuropean Journal of Operational Research
In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if any vertex $v \in V\setminus S$ is adjacent to some vertex $x$ from this subset. A number of real-life problems can be modeled using this problem which is known to be among the difficult NP-hard problems in its class.
Ernesto Parra Inza   +3 more
openaire   +2 more sources

A Lin-Kernighan Heuristic for Single Row Facility Layout [PDF]

open access: yes
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard.
Kothari, Ravi, Ghosh, Diptesh
core  

Advances in Thermal Modeling and Simulation of Lithium‐Ion Batteries with Machine Learning Approaches

open access: yesAdvanced Intelligent Discovery, EarlyView.
Heat generation in lithium‐ion batteries affects performance, aging, and safety, requiring accurate thermal modeling. Traditional methods face efficiency and adaptability challenges. This article reviews machine learning‐based and hybrid modeling approaches, integrating data and physics to improve parameter estimation and temperature prediction ...
Qi Lin   +4 more
wiley   +1 more source

A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws

open access: yesAdvanced Intelligent Discovery, EarlyView.
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows   +7 more
wiley   +1 more source

How to make a greedy heuristic for the asymmetric traveling salesman problem competitive

open access: yes
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP.
Jäger, G., Goldengorin, B.
core  

Heuristic procedures for reactive project scheduling. [PDF]

open access: yes
This paper describes new heuristic reactive project scheduling procedures that may be used to repair resource-constrained roject baseline schedules that suer from multiple activity duration disruptions during project execution.The objective is to ...
Van de Vonder, S   +3 more
core  

Cell Segmentation Beyond 2D—A Review of the State‐of‐the‐Art

open access: yesAdvanced Intelligent Discovery, EarlyView.
Cell segmentation underpins many biological image analysis tasks, yet most deep learning methods remain limited to 2D despite the inherently 3D nature of cellular processes. This review surveys segmentation approaches beyond 2D, comparing 2.5D and fully 3D methods, analyzing 31 models and 32 volumetric datasets, and introducing a unified reference ...
Fabian Schmeisser   +6 more
wiley   +1 more source

Home - About - Disclaimer - Privacy