Displaying similar documents to “Dynamic contact problems in bone neoplasm analyses and the primal-dual active set (PDAS) method”

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

On a new computational algorithm for impacts of elastic bodies

Hynek Štekbauer, Ivan Němec, Rostislav Lang, Daniel Burkart, Jiří Vala (2022)

Applications of Mathematics

Similarity:

Computational modelling of contact problems is still one of the most difficult aspects of non-linear analysis in engineering mechanics. The article introduces an original efficient explicit algorithm for evaluation of impacts of bodies, satisfying the conservation of both momentum and energy exactly. The algorithm is described in its linearized 2-dimensional formulation in details, as open to numerous generalizations including 3-dimensional ones, and supplied by numerical examples obtained...

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...