Pages that link to "Item:Q1340873"
From MaRDI portal
The following pages link to PROFIL/BIAS - A fast interval library (Q1340873):
Displayed 50 items.
- PROFIL/BIAS (Q13487) (← links)
- Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem (Q337679) (← links)
- Verified stability analysis of continuous-time control systems with bounded parameter uncertainties and stochastic disturbances (Q411428) (← links)
- Competitive facility location and design with reactions of competitors already in the market (Q439603) (← links)
- Fast interval matrix multiplication (Q451807) (← links)
- A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability (Q475431) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- The design of the Boost interval arithmetic library (Q817867) (← links)
- Numerical verification method of solutions for elliptic equations and its application to the Rayleigh-Bénard problem (Q849191) (← links)
- Interval modeling of dynamics for multibody systems (Q861880) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Numerical method for verifying the existence and local uniqueness of a double turning point for a radially symmetric solution of the perturbed Gelfand equation (Q875360) (← links)
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure (Q883194) (← links)
- Error bounds for initial value problems by optimization (Q889871) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models (Q960385) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← 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)
- Comparison of four software packages applied to a scattering problem (Q1300480) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Multiple solutions for a semilinear boundary value problem: a computational multiplicity proof. (Q1416464) (← links)
- Computational proofs of the existence of solutions to elasto-plastic torsion problems (Q1585831) (← links)
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane (Q1628064) (← links)
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule (Q1652088) (← links)
- A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014 (Q1730606) (← links)
- A computer-assisted proof on the stability of the Kolmogorov flows of incompressible viscous fluid (Q1877193) (← links)
- Numerical method with guaranteed accuracy of a double turning point for a radially symmetric solution of the perturbed Gelfand equation (Q1877202) (← links)
- Verified solution of large systems and global optimization problems (Q1900761) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- Variable-precision, interval arithmetic coprocessors (Q1916973) (← links)
- Software for high radix on-line arithmetic (Q1916986) (← links)
- Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems (Q1919127) (← links)
- Solution of a transcendental eigenvalue problem via interval analysis (Q1972501) (← links)
- First order rejection tests for multiple-objective optimization (Q2250111) (← links)
- Numerical verifications for eigenvalues of second-order elliptic operators (Q2258353) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- Global optimization of bounded factorable functions with discontinuities (Q2442640) (← links)
- Solving kinematics problems by efficient interval partitioning (Q2443368) (← links)
- The 1-center problem in the plane with independent random weights (Q2456633) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities (Q2511225) (← links)