scientific article; zbMATH DE number 3247783
From MaRDI portal
Publication:5534682
zbMath0154.19506MaRDI QIDQ5534682
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, Rational preemptive scheduling, Mixed models, random utilities, and the triangle inequality, A linear continuous transportation problem, The complexity of routing in~hierarchical PNNI networks, Evaluation of elastic moduli of composite materials by linear programming, Preemptive scheduling of interval orders is polynomial, An improved version of the out-of-kilter method and a comparative study of computer codes, Cooperative Games (Von Neumann-Morgenstern Stable Sets), Some Results on Sparse Matrices, Some theoretical implications of local optimization, Ranked linear models and sequential patterns recognition, Primal transportation and transshipment algorithms, On some relations between a dual pair of multiple objective linear programs, Stochastische Transportprobleme, Another proof that assignment games have singleton cores only if multiple optimal matchings exist, On the linear programming approach to the optimality property of Prokhorov's distance, Discrete right hand side parametrization for linear integer programs, On the analysis of structural design, An absolute-value linear programming problem, An economic interpretation of duality in linear programming, Iterative decoding of linear codes by a modulo-2 linear program, Some NP-complete problems in linear programming, Variations on the theme of slacks-based measure of efficiency in DEA, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, Conversion of programs between computers: Interpreters, simulators and compilers, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, Graphical analysis of duality and the Kuhn-Tucker conditions in linear programming, A linear and discrete programming framework for representing qualitative knowledge, Tools for reformulating logical forms into zero-one mixed integer programs
