scientific article; zbMATH DE number 3501238
From MaRDI portal
Publication:4082542
zbMath0319.90036MaRDI QIDQ4082542
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Diophantine equations (11D99)
Related Items (26)
A note on the cake-division problem ⋮ Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process ⋮ Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption ⋮ The concept of sequential optimality for problems in numerical analysis ⋮ The determinant of a tree's neighborhood matrix ⋮ Approximating fair division with a limited number of cuts ⋮ On vector languages ⋮ Some n by dn linear complementarity problems ⋮ Integer resource allocations with the objective function separable into pairs of variables ⋮ Dividing a cake fairly ⋮ Partial-match retrieval for dynamic files ⋮ The dynamic set covering problem ⋮ Optimal hierarchy structures for multi-attribute-criteria decisions ⋮ A note on optimization in integers ⋮ Discrete optimization algorithms and problems of decision making in a fuzzy environment ⋮ Two classes of location problems on tree networks ⋮ One modification of Gomory's algorithm ⋮ Algebraic formulation of circuit design problems ⋮ Algorithms of discrete optimization and their application to problems with fuzzy coefficients ⋮ A sequentially optimal algorithm for numerical integration ⋮ Optimal partial-match retrieval ⋮ Multivariable monotonic optimization over multivalued logics and rectangular design lattices ⋮ Unnamed Item ⋮ Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles ⋮ Computational aspects of two-segment separable programming ⋮ Green eggs and ham
This page was built for publication:
