图论是很重要的一门数学分支，在优化模型中应用非常广泛。应用lingo可以解决大部分图论的问题！

针对具有曼哈顿模型的一类通道布线，提出了一个依据图论模型的最优轨道高度布线算法。算法根据通道上结点的水平约束图和垂直约束图，依次安排好每一个结点的布线轨道，进而通过通孔可以把所有的结点在2层轨道上布线完成。通过计算分析，该算法相对以前的算法能够达到更优的布线高度，并且其复杂性保持不变。

图论〔Graph Theory〕是数学的一个分支。它以图为研究对象。图论中的图是由若干给定的点及连接两点的线所构成的图形，这种图形通常用来描述某些事物之间的某种特定关系，用点代表事物，用连接两点的线表示相应两个事物间具有这种关系。

图论最大流理论在机场登机口分配中的应用（matlab实现）

某田径运动会共有七个项目的比赛，分别为100米、200米、跳高、跳远、铅球、铁饼和标枪。每个选手最多参加3个项目，现有六名选手参赛，他们选择的项目已知。根据选手所选项目，进行各项目比赛时间的安排。本实验将满足每个选手参加的各个项目不能同时进行，使运动会在尽可能短的时间内完成

中国邮递员问题 一位邮递员从邮局选好邮件去投递，然后返回邮局，当然他必须经过他负责投递的每条街道至少一次，为他设计一条投递路线，使得他行程最短。 上述中国邮递员问题的数学模型是：在一个赋权连通图上求一个含所有边的回路，且使此回路的权最小。 显然，若此连通赋权图是Euler图，则可用Fleury算法求Euler回路，此回路即为所求。

B站录课资源网址： https://space.bilibili.com/609703132/channel/detail?cid=142579&ctype=0

作者: Jeremy Kepner / John Gilbert 出版社: Society for Industrial & Applied Mathematics 出版年: 2011-7-14 页数: 389 定价: USD 110.00 装帧: Hardcover ISBN: 9780898719901 Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse areas as combinatorial optimization, complexity theory, and topology. Algorithms on graphs are applied in many ways in today s world - from Web rankings to metabolic networks, from finite element meshes to semantic graphs. The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation, and improved performance. Graph Algorithms in the Language of Linear Algebra is the first book to cover graph algorithms accessible to engineers and scientists not trained in computer science but having a strong linear algebra background, enabling them to quickly understand and apply graph algorithms. It also covers array-based graph algorithms, showing readers how to express canon

基于Matlab平台的图论模型的仿真实验.pdf

J.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdf