Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. This book not only includes the most recent results, but also highlights several surprising connections between diverse topics within combinatorial optimization. It offers a unified ...
Substitution decomposition for discrete struc- tures and connections with combinatorial optimization. In Algebraic and combina- torial methods in operations research, volume 95 of North-Holland Math. Stud., pages 257-355. North-Holland, Amsterdam, 1984....
现货Connections in Combinatorial Optimization 已有1人评价 亲密联系 英文原版 Intimate Connections 心理学 人际关系处理 David D. Burns 英文版 9780451148452 已有1人评价 美国海尼曼教师文学活动指导Genre Connections:Lessons to Launch Literary and Nonfiction Texts 文学非小说课程 已有1人评价 现货 微分几何...
摘要: We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connection subgraph problem关键词: CiteSeerX citations Connections in Networks: Hardness of Feasibility versus Optimality ⋆ Jon ...
Digital reconstruction has been instrumental in deciphering how in vitro neuron architecture shapes information flow. Emerging approaches reconstruct neural systems as networks with the aim of understanding their organization through graph theory. Comput
Antoni, C., Giannessi, F., Tardella, F. (2013). Connections Between Continuous and Discrete Extremum Problems, Generalized Systems, andVariational Inequalities∗. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org...
On the History of Combinatorial Optimization (Till 1960) Similarly, assigning jobs to men, transporting goods, and making connections, form elementary problems not just considered by the mathematician. It makes that these problems probably can be traced back far in history. In this survey how......
There are well-established connections between combinatorial optimization, optimal transport theory and Hydrodynamics, through the linear assignment problem in combinatorics, the Monge-Kantorovich problem in optimal transport theory and the model of inviscid, potential, pressure-less fluids in Hydrodynamics. ...
In this article, constrained continuous and combinatorial vector optimization problems (VOPs) are considered in the setting of finite-dimensional Euclidean spaces. Equivalence results between constrained integer and continuous VOPs are established by virtue of that between a constrained VOP and its ...
Electronic Notes in Discrete MathematicsTardella, F (2004) Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of linear programming. Electron Notes Discret Math 17: pp. 257-262Tardella, F. (2004), "Connections between continuous and ...