scientific article; zbMATH DE number 3378735
From MaRDI portal
Publication:5650538
zbMath0238.90073MaRDI QIDQ5650538
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Pseudo-orders: Definition, properties and numerical representation ⋮ Ein axiomatiseh begründeter ansatz zur konstruktion von prävalenzrelationen ⋮ Inequalities for the chromatic numbers of graphs ⋮ Simple plant location under uniform delivered pricing ⋮ Biorders with frontier ⋮ About the shortest chain between two vertices in a quasi strongly connected digraph with a potential ⋮ Analysis of static and dynamic structures in economic models: Methodological and practical aspects ⋮ The one-machine sequencing problem ⋮ A new method for constructing a minimal PERT network ⋮ Note on graphs and weakly cyclic matrices ⋮ Optimal implementation of selectors in a data-base ⋮ Synthetic description of a semiorder ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Numerical representation of \(PQI\) interval orders ⋮ Un algorithme combinatoire pour la résolution des problèmes du type du permanent ⋮ Local adjustments: A general algorithm ⋮ Graph theory ⋮ Concave cost minimization on networks ⋮ Domination in Digraphs ⋮ All shortest distances in a graph. An improvement to Dantzig's inductive algorithm ⋮ On fuzzification of some concepts of graphs ⋮ Financial systems: A few theoretical and algebraic considerations for their modeling
