نتایج جستجو برای: exact

تعداد نتایج: 120378  

Journal: :European Journal of Operational Research 2010
Maria Albareda-Sambola Juan A. Díaz Elena Fernández

In this work we study the Capacitated p-Center Problem (CpCP ) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP , and we propose two different Lagrangean duals based on each of the auxiliary problems. The lower and upper bounds provided by each of the Lagrangean duals reduce notably the set of candidate radii and allow to solve the proble...

Journal: :Inf. Process. Lett. 1998
Venkatesh Raman Bala Ravikumar S. Srinivasa Rao

It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears in at most three clauses, we give an exact algorithm for MAXSAT that takes at most O(3 n=2 n) steps where n is th...

2004
Roberto Montemanni Luca Maria Gambardella

We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and the total power consumption is minimized. A new exact algorithm, based on a new integer programming model, is described in this paper together with a new preprocessing technique.

Journal: :IET Communications 2007
Yong-Jin Lee Mohammed Atiquzzaman

We have developed an exact model and algorithm for the delay-constrained minimum cost loop problem (DC-MCLP) of finding broadcast loops from a source node. While the traditional minimum cost loop problem (MCLP) deals with only the traffic capacity constraint served by a port of source node, the DC-MCLP deals with the mean network delay and traffic capacity constraints simultaneously. The DC-MCL...

Journal: :J. Global Optimization 1994
Panos M. Pardalos Jue Xue

In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.

Journal: :Expositiones Mathematicae 2010

Journal: :The Journal of Chemical Physics 2015

Journal: :Nature 1889

Journal: :Illinois Journal of Mathematics 1981

Journal: :journal of ultrafine grained and nanostructured materials 2015
hessam rouhi reza ansari mansour darvizeh

it has been revealed that the surface stress effect plays an important role in the mechanical behavior ofstructures (such as bending, buckling and vibration) when their dimensions are on the order ofnanometer. in addition, recent advances in nanotechnology have proposed several applications fornanoscale shells in different fields. hence, in the present article, within the framework of surfaceel...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید