More information about this series at http://www.springer.com/series/7393 Boris Goldengorin Editor Optimization Problems in Graph Theory In Honor of Gregory Z. Gutin's 60th Birthday 123 Editor Boris Goldengorin Department of Information Systems and Decision Science Merrick School of Business ...
预订Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's [ISBN:9783030069216] 【全球购】进口原版图书,一般4~6周左右国内 作者:Goldengorin,Boris出版社:Springer出版时间:2018年12月 手机专享价 ¥ 当当价 降价通知 ¥859.00 ...
We show that the following three problems in graph theory belong to NP∩co-NP. 1. Wang and Kleitman (1972) characterized degree-sequences of simple k-connected undirected graphs. We solve the corresponding problem for digraphs. 2. Edmonds (1973) characterized digraphs admitting k disjoint spannin...
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit ...
The aim of this research is to give a systematic way to solve optimization problems on hybrid systems. The target classes of hybrid systems are linear hybrid automata and piecewise linear systems. The behavior of a hybrid system is represented by a directed acyclic graph such that each node is...
A (MI)LP is a very powerful tool, which allows the efficient optimization of graph problems, e.g., graph cut, graph matching, max-flow or network optimization, see Almohamad et al., Amaldi et al. or Komodakis et al. [1, 2, 36], logic inference, see Makhortov et al. or Krishnan...
Some of the specific problems to be addressed in this thesis on both the theory and the application of nonlinear optimization are explained below: Graph theoretic algorithms for low-rank optimization problems: There is a rapidly growing interest in the recovery of an unknown low-rank matrix from ...
Section 5 discusses modeling CO problems to simplify realistic complications and reduce problem difficulties. Modeling consists of illustrating the graph theory concepts, the mathematical programming, and the constraint programming paradigms. Finally, Section 6 presents solution methods, including exact methods...
Mosaic graphs, such as the plane representations of the five platonic solids or the three regular and the hyperbolic tesselations of the plane, often are connected with problems in group theory, geometry and especially hyperbolic geometr... H Harborth - Springer Netherlands 被引量: 11发表: 1990...
Nonlinear constrained optimization problems involve the search for a minimum of a nonlinear objective function subject to a set of nonlinear constraints. From: Journal of Power Sources, 2011 About this pageAdd to MendeleySet alert Also in subject area: MathematicsDiscover other topics ...