Triangulations (tilings) and certain block triangular matrices

DOI10.1007/BF02591857MaRDI QIDQ3688133zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

block triangular matricesLeontief substitution systemspartition of polygonstilingtriangulation

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Mathematical programming (90C99) Multisectoral models in economics (91B66)

Recommendations

• On the minimality of polygon triangulation
• Polygon triangulation: Efficiency and minimality
• Tiling polygons with parallelograms
• New results for the minimum weight triangulation problem
• Tiling a polygon with parallelograms

Cites work

• Computation of Matrix Chain Products. Part I
• Extreme points of Leontief substitution systems
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• On the time required for a sequence of matrix products
• Optimal Solution of a Dynamic Leontief Model with Substitution

Cited in

(7)

• Regular production systems and triangle tilings
• Dynamic programming and graph optimization problems
• The associahedron and triangulations of the \(n\)-gon
• scientific article; zbMATH DE number 3908501 (Why is no real title available?)
• A reinforcement learning based algorithm to find a triangular Graham partition
• On a linear program for minimum-weight triangulation
• Optimal area polygonisation problems: mixed integer linear programming models

This page was built for publication: Triangulations (tilings) and certain block triangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688133)