The following pages link to (Q5808752):
Displaying 50 items.
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model (Q486944) (← links)
- The double pivot simplex method (Q684156) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization (Q813340) (← links)
- Experiments with external pivoting (Q909578) (← links)
- Bruno de Finetti and the case of the critical line's last segment (Q939373) (← links)
- George Dantzig in the development of economic analysis (Q951089) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems (Q990486) (← links)
- A linear scheme satisfying a maximum principle for anisotropic diffusion operators on distorted grids (Q1000667) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- On ``pre-historic'' linear programming and the figure of the Earth (Q1682983) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Geometric random edge (Q2364496) (← links)
- Fuzzy facility location-allocation problem under the Hurwicz criterion (Q2384629) (← links)
- A simple direct cosine simplex algorithm (Q2391301) (← links)
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion (Q2426892) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Three circle theorems in partial differential equations and applications to improperly posed problems (Q2523806) (← links)
- An economic interpretation of duality in linear programming (Q2538772) (← links)
- Men and progress in linear programming (Q3089104) (← links)
- Bestimmung einer ersten Basislösung beim „Linearen Programmieren“ (Q3270241) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- ON MARINE LIABILITY PORTFOLIO MODELING (Q5213439) (← links)
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)
- Pairwise comparisons or constrained optimization? A usability evaluation of techniques for eliciting decision priorities (Q6060653) (← links)
- Optimization of sparsity-constrained neural networks as a mixed integer linear program (Q6145048) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
