Results 201 to 210 of about 51,613 (264)

Optimization of tray inventory levels in hospitals from an integral perspective. [PDF]

open access: yesHealth Care Manag Sci
Bos H   +4 more
europepmc   +1 more source

A Heuristic Scheduling Algorithm

Journal of the Operational Research Society, 1980
This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame of the schedule and the difference between the exogenously given number of people desired at each available location-activity-period position and those ...
Hosios, A. J., Rousseau, J. M.
openaire   +1 more source

Heuristic Algorithms

2012
This chapter approaches the Truck Loading Problem, which is formulated as a rich problem with the classic one dimensional Bin Packing Problem (BPP) and five variants. The literature review reveals that related work deals with three variants at the most.
Laura Cruz Reyes   +6 more
openaire   +1 more source

Heuristic Clustering Algorithms

2020
This chapter is devoted to the most popular heuristic partitional clustering algorithms such as k-means, k-medians, and k-medoids. In addition, we give an overview of some clustering algorithms based on mixture models, self-organizing map, and fuzzy clustering. The description of these algorithms as well as their flowcharts is presented.
Adil Bagirov   +2 more
openaire   +1 more source

Heuristics and Genetic Algorithms

INCOSE International Symposium, 2006
AbstractGenetic algorithms are design tools used in generating optimal solutions. While they can often be shown to outperform various heuristic methods and hybrid approaches, using a combination of evolutionary algorithms and heuristic approaches can generate an optimal solution more quickly than either of the two methods independently.
Michael D. Mobley   +2 more
openaire   +1 more source

A heuristic triangulation algorithm

Journal of Algorithms, 1987
We propose a heuristic triangulation algorithm. The algorithm runs in polynomial time and produces a triangulation within a ratio of O(log n) to the cost of an optimal triangulation of a set of n points in the Euclidean plane.
Plaisted, David A., Hong, Jiarong
openaire   +1 more source

Home - About - Disclaimer - Privacy