scientific article; zbMATH DE number 3069632

Publication date: 1951

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

mathematical biology, operations research

Related Items

Geometric random edge, On the complexity of some basic problems in computational convexity. I. Containment problems, Algebraic simplex initialization combined with the nonfeasible basis method, Fuzzy facility location-allocation problem under the Hurwicz criterion, Parametric linear programming and anti-cycling pivoting rules, A simple direct cosine simplex algorithm, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, A polynomial projection-type algorithm for linear programming, Eine Methode der Produktionsplanung, Implementing the simplex method as a cutting-plane method, with a view to regularization, A linear programming primer: from Fourier to Karmarkar, Bin packing under linear constraints, On ``pre-historic linear programming and the figure of the Earth, A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term, Pairwise comparisons or constrained optimization? A usability evaluation of techniques for eliciting decision priorities, Optimization of sparsity-constrained neural networks as a mixed integer linear program, Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, A new linear programming algorithm - better or worse than the simplex method?, Experiments with external pivoting, A two-phase support method for solving linear programs: numerical experiments, A counterexample to the Hirsch conjecture, Bestimmung einer ersten Basislösung beim „Linearen Programmieren“, A Friendly Smoothed Analysis of the Simplex Method, An exploratory computational analysis of dual degeneracy in mixed-integer programming, Algorithms, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, A guide to conic optimisation and its applications, A projective simplex algorithm using LU decomposition, The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model, Bruno de Finetti and the case of the critical line's last segment, George Dantzig in the development of economic analysis, George Dantzig's impact on the theory of computation, Solving combinatorial optimization problems using Karmarkar's algorithm, The double pivot simplex method, Optimality conditions for maximizing a function over a polyhedron, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, Evaluating the impact of AND/OR search on 0-1 integer linear programming, A formalization of convex polyhedra based on the simplex method, Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems, A linear scheme satisfying a maximum principle for anisotropic diffusion operators on distorted grids, A redundant Klee-Minty construction with all the redundant constraints touching the feasible region, ON MARINE LIABILITY PORTFOLIO MODELING, Three circle theorems in partial differential equations and applications to improperly posed problems, Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm, A generalized dual phase-2 simplex algorithm., A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, Men and progress in linear programming, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, An overview on the simplex algorithm, An economic interpretation of duality in linear programming, POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis, Edge-directions of standard polyhedra with applications to network flows, Computation of efficient compromise arcs in convex quadratic multicriteria optimization