The following pages link to Bahman Kalantari (Q167858):
Displayed 50 items.
- Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram (Q542397) (← links)
- Alternating sign matrices and polynomiography (Q648417) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- Karmarkar's algorithm with improved steps (Q910334) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- Approximating the diameter of a set of points in the Euclidean space (Q1123610) (← links)
- Generalization of Karmarkar's algorithm to convex homogeneous functions (Q1197885) (← links)
- On the order of convergence of a determinantal family of root-finding methods (Q1283250) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656) (← links)
- A basic family of iteration functions for polynomial root finding and its characterizations (Q1360168) (← links)
- A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors (Q1361421) (← links)
- On linear programming and matrix scaling over the algebraic numbers (Q1361844) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- On extraneous fixed-points of the basic family of iteration functions (Q1415412) (← links)
- New formulas for approximation of \(\pi\) and other transcendental numbers (Q1587024) (← links)
- An algorithmic separating hyperplane theorem and its applications (Q1728094) (← links)
- Symmetric functions and root-finding algorithms (Q1775732) (← links)
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices (Q1911415) (← links)
- High order iterative methods for approximating square roots (Q1914878) (← links)
- On the complexity of nonnegative-matrix scaling (Q1915608) (← links)
- Newton's method and generation of a determinantal family of iteration functions (Q1975681) (← links)
- Characterization of local optima of polynomial modulus over a disc (Q2138407) (← links)
- Construction of large-scale global minimum concave quadratic test problems (Q2265952) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- On general convergence in extracting radicals via a fundamental family of iteration functions (Q2370693) (← links)
- Algorithms for quaternion polynomial root-finding (Q2434926) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling (Q2496650) (← links)
- Polynomiography and Chaos (Q2865783) (← links)
- The State of the Art of Voronoi Diagram Research (Q2868514) (← links)
- On Properties of Forbidden Zones of Polygons and Polytopes (Q2868525) (← links)
- A Geometric Modulus Principle for Polynomials (Q3106511) (← links)
- Mollified Zone Diagrams and Their Computation (Q3223918) (← links)
- Penalty for zero–one integer equivalent problem (Q3328282) (← links)
- (Q3543637) (← links)
- A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity (Q3566648) (← links)
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems (Q3686435) (← links)
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions (Q3780011) (← links)
- A new class of heuristic algorithms for weighted perfect matching (Q3813310) (← links)
- Diagonal Matrix Scaling and Linear Programming (Q4015441) (← links)
- On the Complexity of Matrix Balancing (Q4337392) (← links)
- Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP (Q4344457) (← links)
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound (Q4654024) (← links)
- (Q4668906) (← links)
- (Q4729611) (← links)