Publication:4082542
From MaRDI portal
zbMath0319.90036MaRDI QIDQ4082542
Publication date: 1970
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C10: Integer programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
11D99: Diophantine equations
Related Items
A note on optimization in integers, A note on the cake-division problem, The concept of sequential optimality for problems in numerical analysis, 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, A sequentially optimal algorithm for numerical integration, The determinant of a tree's neighborhood matrix, On vector languages, Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles, Green eggs and ham, Approximating fair division with a limited number of cuts, Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process, Discrete optimization algorithms and problems of decision making in a fuzzy environment, Algorithms of discrete optimization and their application to problems with fuzzy coefficients, Multivariable monotonic optimization over multivalued logics and rectangular design lattices, Two classes of location problems on tree networks, Algebraic formulation of circuit design problems, Unnamed Item, Computational aspects of two-segment separable programming, Optimal partial-match retrieval
