The following pages link to INTOPT_90 (Q16874):
Displaying 50 items.
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Some variants of the controlled random search algorithm for global optimization (Q868546) (← links)
- Solving interval constraints by linearization in computer-aided design (Q868685) (← links)
- A new exclusion test for finding the global minimum (Q869487) (← links)
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure (Q883194) (← links)
- A new approach to fuzzy initial value problem (Q891196) (← links)
- Probability bounds analysis for nonlinear population ecology models (Q899221) (← links)
- A method to find all the roots of the system of nonlinear algebraic equations based on the Krawczyk operator (Q904440) (← links)
- Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems (Q907591) (← links)
- Certified error bounds for uncertain elliptic equations (Q930711) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems (Q956687) (← links)
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models (Q960385) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- On interval fuzzy negations (Q991414) (← links)
- Comparison between Baumann and admissible simplex forms in interval analysis (Q995937) (← links)
- A framework for existence tests based on the topological degree and homotopy (Q1006842) (← links)
- A new method for solving interval and fuzzy equations: linear case (Q1007896) (← links)
- First-order design of geodetic networks using the simulated annealing method (Q1013464) (← links)
- Slope enclosures for functions given by two or more branches (Q1014884) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method (Q1043352) (← links)
- Optimal enclosure of quadratic interval functions (Q1276128) (← links)
- On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
- A nonsmooth global optimization technique using slopes: The one-dimensional case (Q1304345) (← links)
- An interval entropy penalty method for nonlinear global optimization (Q1383743) (← links)
- When is the product of intervals also an interval? (Q1387763) (← links)
- Worst-case simulation of discrete linear time-invariant interval dynamic systems (Q1397888) (← links)
- Numerical solution for bounding feasible point sets (Q1398432) (← links)
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints (Q1404233) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Rational functions with prescribed global and local minimizers (Q1411322) (← links)
- New interval analysis support functions using gradient information in a global minimization algorithm (Q1411328) (← links)
- On first zero crossing points. (Q1427655) (← links)
- The hull of preconditioned interval linear equations (Q1577432) (← links)
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (Q1577439) (← links)
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (Q1583690) (← links)
- Recent developments and trends in global optimization (Q1593827) (← links)
- Interval mathematics, algebraic equations and optimization (Q1593830) (← links)
- Using interval analysis for solving planar single-facility location problems: New discarding tests (Q1595899) (← links)
- Efficient interval linear equality solving in constraint logic programming (Q1597646) (← links)
- A realistic (non-associative) logic and a possible explanations of \(7\pm 2\) law (Q1603303) (← links)
- Accelerating filtering techniques for numeric CSPs (Q1606118) (← links)
- On existence and uniqueness verification for non-smooth functions (Q1611220) (← links)
- Numerical validation of solutions of complementarity problems: the nonlinear case (Q1615000) (← links)
- Always convergent methods for nonlinear equations of several variables (Q1646676) (← links)
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule (Q1652088) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
