A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...

In this paper we confront the job shop scheduling problem with total flow time minimization. We start extending the disjunctive graph model used for makespan minimization to represent the version of the problem with total flow time minimization. Using this representation, we adapt local search neighborhood structures originally defined for makespan minimization. The proposed neighborhood struct...

Abductive reasoning involves determining a parsimonious set of explanations that can account for a set of observations. In the Boolean minimization problem, the designer attempts to express a Boolean formula as a sum of products or product of sums expression of the smallest size that satisfies the desired function. In this paper, we show that independent abduction problem can be encoded as an i...

This paper presents a new method for the identification of Hammerstein systems. The parameter estimation problem is formulated as a rank minimization problem by constraining a finite dimensional time dependency between signals. Due to the unknown intermediate signal, the rank minimization problem cannot be solved directly. Thus, the rank minimization problem is reformulated as an intermediate s...

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...

A multilayered particle is illuminated by plane acoustic or electromagnetic waves of one or several frequencies. We consider the inverse scattering problem for the identification of the layers and of the refraction coefficients of the scatterer in a non-Born region of scattering. Local de-terministic and global probabilistic minimization methods are studied. A special Reduction Procedure is int...

Low-rank matrix approximation, which aims to construct a low-rank matrix from an observation, has received much attention recently. An efficient method to solve this problem is to convert the problem of rank minimization into a nuclear norm minimization problem. However, soft-thresholding of singular values leads to the elimination of important information about the sensed matrix. Weighted nucl...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...

The quasi-static problem of elastoplasticity with isotropic hardening is considered, with particular emphasis on its numerical solution by means of a Newton-like method. The smoothness properties necessary for such method can be ensured by Moreau-Yosida’s theorem. After time discretization, the classical formulation of the elastoplastic problem is transformed to a minimization problem. The conv...