Search results for " optimization"

Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups

2020

We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.

Producer's spatial equilibrium with a fuzzy constraint

1980

The classical theory of the producer’s equilibrium rests on two sets of particularly restrictive hypotheses. First it is implicitely assumed that all inputs and outputs are located in a single place where the producer is also implanted and where the production is carried out. Next it is assumed that the producer follows a precise behaviour pattern, by this we mean that the producer has complete information concerning the conditions of hisproductive activity and he has perfect command over both the set of inputs and the set of outputs; he realises the maximum profit allowed by the technological constraint which limits his possible actions and by the given price system. The aim of this study …

Tabu search for min-max edge crossing in graphs

2020

Abstract Graph drawing is a key issue in the field of data analysis, given the ever-growing amount of information available today that require the use of automatic tools to represent it. Graph Drawing Problems (GDP) are hard combinatorial problems whose applications have been widely relevant in fields such as social network analysis and project management. While classically in GDPs the main aesthetic concern is related to the minimization of the total sum of crossing in the graph (min-sum), in this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes. Recently proposed in scientific literature, the Min…

On complexity and motion planning for co-rank one sub-Riemannian metrics

2004

In this paper, we study the motion planning problem for generic sub-Riemannian metrics of co-rank one. We give explicit expressions for the metric complexity (in the sense of Jean (10,11)), in terms of the elementary invariants of the problem. We construct asymptotic optimal syntheses. It turns out that among the results we show, the most complicated case is the 3-dimensional. Besides the generic C ∞ case, we study some non-generic generalizations in the analytic case.

Orientation matters

2008

The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…

Table of periodic properties of human immunodeficiency virus inhibitors

2010

Classification algorithms are proposed based on information entropy. The feasibility of mixing a given human immunodeficiency virus (HIV) inhibitor with dissimilar ones is studied. The 31 inhibitors are classified by their structural chemical properties. Many classification algorithms are based on information entropy. An excessive number of results appear compatible with the data and suffer combinatorial explosion. However, after the equipartition conjecture one has a selection criterion. According to this conjecture, the best configuration is that in which entropy production is most uniformly distributed. The structural elements of an inhibitor can be ranked according to their inhibitory a…

Special issue on geometric constraints and reasoning

2012

Special issue on the occasion of the International Workshop on Complex Networks and their Applications

2014

On a topology optimization problem governed by two-dimensional Helmholtz equation

2015

The paper deals with a class of shape/topology optimization problems governed by the Helmholtz equation in 2D. To guarantee the existence of minimizers, the relaxation is necessary. Two numerical methods for solving such problems are proposed and theoretically justified: a direct discretization of the relaxed formulation and a level set parametrization of shapes by means of radial basis functions. Numerical experiments are given.

Projective Reeds-Shepp car onS2with quadratic cost

2008

Fix two points x, ¯ ∈ S 2 and two directions (without orientation) η,¯ η of the velocities in these points. In this paper we are interested to the problem of minimizing the cost