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

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

Journal: :Calculus of Variations and Partial Differential Equations 2021

In this paper, we define a new discrete curvature on two and three dimensional triangulated manifolds, which is modification of the well-known these manifolds. The definition more natural respects scaling exactly same way as Gauss does. Moreover, can be used to approximate surfaces. Then study corresponding constant problem, called combinatorial Yamabe by versions Ricci flow Calabi for surfaces...

Journal: :journal of algorithms and computation 0
stephen j. gismondi department of mathematics & statistics, university of guelph, guelph, on, ca. n1g 2w1

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: :CoRR 2013
Mark Sh. Levin

The paper briefly describes a basic set of special combinatorial engineering frameworks for solving complex problems in the field of hierarchical modular systems. The frameworks consist of combinatorial problems (and corresponding models), which are interconnected/linked (e.g., by preference relation). Mainly, hierarchical morphological system model is used. The list of basic standard combinato...

Journal: :CoRR 2018
Chams Lahlou Laurent Truffet

The ecologist H. T. Odum introduced a principle of physics, called Maximum Empower, in order to explain self-organization in a system (e.g. physical, biological, social, economical, mathematical, ...). The concept of empower relies on emergy, which is a second notion introduced by Odum for comparing energy systems on the same basis. The roots of these notions trace back to the 50’s (with the wo...

Journal: :Proceedings of the American Mathematical Society 1993

Journal: :European Journal of Operational Research 2007
Bahram Alidaee Fred Glover Gary A. Kochenberger Haibo Wang

The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more tradit...

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

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