Results 31 to 40 of about 2,708 (158)
BMC Health Services Research, 2023 Background Appointment non-attendance – often referred to as “missed appointments”, “patient no-show”, or “did not attend (DNA)” – causes volatility in health systems around the world. Of the different approaches that can be adopted to reduce patient non-
Kalin Werner +6 more
doaj +1 more source
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Exponential upper bounds for the runtime of randomized search heuristics [PDF]
Theoretical Computer Science, 2020 We argue that proven exponential upper bounds on runtimes, an established area in classic algorithms, are interesting also in heuristic search and we prove several such results. We show that any of the algorithms randomized local search, Metropolis algorithm, simulated annealing, and (1+1) evolutionary algorithm can optimize any pseudo-Boolean weakly ...
openaire +5 more sources
Scheduling parallel extrusion lines [PDF]
Journal of Project ManagementThis paper introduces the problem of scheduling jobs on parallel plastic extrusion lines where each line is composed of one or more than one extruder.
Fayez F. Boctor +2 more
doaj +1 more source
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem [PDF]
, 2021 We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph.
Peng, P. +3 more
core +1 more source
A greedy randomized adaptive search procedure application to solve the travelling salesman problem
International Journal of Industrial Engineering and Management, 2019 The main objective of this article is to show an algorithm capable to find a minimal total length evaluation function roundtrip in symmetric Travelling Salesman Problem (TSP). Application of concepts related to Greedy Randomized Adaptive Search Procedure
Alvaro Neuenfeldt Júnior +1 more
doaj +1 more source
Towards a Theory of Randomized Search Heuristics [PDF]
, 2003 There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP≠P or NP≠RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain.
openaire +2 more sources
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +1 more source
Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 Meta-heuristics are commonly used to solve combinatorial problems in practice. Many approaches provide very good quality solutions in a short amount of computational time; however most meta-heuristics use parameters to tune the performance of the meta ...
Seyhun HEPDOGAN +3 more
doaj
, 2009 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K +3 more
core +1 more source