Transportation networks: Old and new

DOI10.1007/BF02664795zbMath0858.90129OpenAlexW2314868022MaRDI QIDQ1815736

Yanpei Liu

Publication date: 12 December 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02664795

zbMATH Keywords

transportation networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical methods for integral equations (65R20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Applications of graph theory to circuits and networks (94C15) Graphical methods in numerical analysis (65S05)

Related Items (1)

Orthogonal drawings of graphs for the automation of VLSI circuit design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of rooted c-nets
• Enumerating rooted loopless planar maps
• An unavoidable set of configurations in planar trigangulations
• A graph partition problem
• The dissection of rectangles into squares
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• A polyhedral theory on graphs
• Combinatorial invariants on planar graphs
• Paths, Trees, and Flowers
• The enumeration of c-nets via quadrangulations
• Orientable embedding of Cayley graphs

This page was built for publication: Transportation networks: Old and new