scientific article; zbMATH DE number 3069632

Cited in

(68)

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

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)