scientific article; zbMATH DE number 3069632

Cited in

(58)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5808752)