نتایج جستجو برای: combinatorial optimization

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

H. Abaci, M. Askarian, M. E. Uz, P. Sharafi,

Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...

Journal: :journal of artificial intelligence in electrical engineering 0

in this paper proposes a fuzzy multi-objective hybrid genetic and bee colony optimization algorithm(ga-bco) to find the optimal restoration of loads of power distribution network under fault.restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. to improve the efficiency of restoration and facilitate theactivity...

Journal: :IEEJ Transactions on Power and Energy 1994

Journal: :Discrete Applied Mathematics 2012

2015
Mauricio G. C. Resende

The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...

The worldwide rivalry of commerce leads organizations to focus on selecting the best project portfolio among available projects through utilizing their scarce resources in the most effective manner. To accomplish this, organizations should consider the intrinsic uncertainty in projects on the basis of an appropriate evaluation technique with regard to the flexibility in investment decision-maki...

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

Journal: :Revista de Matemática: Teoría y Aplicaciones 2012

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

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