scientific article; zbMATH DE number 761488
From MaRDI portal
Publication:4835644
Cited in
(62)- Dense linear system: A parallel self-verified solver
- Logcf: an efficient tool for real root isolation
- Interval Methods for Global Optimization Using the Boxing Method
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Precise numerical computation
- The 1-center problem in the plane with independent random weights
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- On some Volterra and Fredholm problems via the unified integrodifferential quadrature method
- Interval arithmetic using expression templates, template meta programming and the upcoming C++ standard
- Multiple/arbitrary precision interval computations in C-XSC
- A new hybrid genetic algorithm for global optimization
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
- scientific article; zbMATH DE number 58446 (Why is no real title available?)
- An improved lower bound on the number of limit cycles bifurcating from a quintic Hamiltonian planar vector quintic perturbation
- Two acceleration mechanisms in verified global optimization
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Toward a definition and understanding of correlation for variables constrained by random relations
- Design of a parallel linear algebra library for verified computation
- A branch-and-prune method for global optimization
- Heuristic rejection in interval global optimization
- Mathematically rigorous global optimization in floating-point arithmetic
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Calculating uncertainty intervals in approximate equation systems
- scientific article; zbMATH DE number 488523 (Why is no real title available?)
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Computer arithmetic and validity. Theory, implementation, and applications
- How do you compute the midpoint of an interval?
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A generalized integral quadratic method. I: An efficient solution for one-dimensional Volterra integral equation
- Bound constrained interval global optimization in the COCONUT environment
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Empirical convergence speed of inclusion functions for facility location problems
- Interval constraint propagation with application to bounded-error estimation
- An approach for solving competitive location problems with variable demand using multicore systems
- An improved lower bound on the number of limit cycles bifurcating from a Hamiltonian planar vector field of degree 7
- A new inclusion function for optimization: kite -- the one-dimensional case
- scientific article; zbMATH DE number 434845 (Why is no real title available?)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- Inner and outer bounds for the solution set of parametric linear systems
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations
- Invertibility properties of singular integral operators associated with the Lamé and Stokes systems on infinite sectors in two dimensions
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Bounding the zeros of an interval equation
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Uses of new sensitivity and DAE solving methods in SmartMobile for verified analysis of mechanical systems
- A robust and efficient algorithm for planar competitive location problems
- Extended interval Newton method based on the precise quotient set
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Enclosing all zeros of an analytic function - a rigorous approach
- The impact of data distribution in accuracy and performance of parallel linear algebra subroutines
- Solving dense interval linear systems with verified computing on multicore architectures
- High accuracy and interval arithmetic on multicore processors
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- SmartMOBILE and its applications to guaranteed modeling and simulation of mechanical systems
- A note on the convergence of parametrised non-resonant invariant manifolds
- Computing the noncentral-F distribution and the power of the F-test with guaranteed accuracy
- New interval methods for constrained global optimization
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Locating and counting equilibria of the Kuramoto model with rank-one coupling
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 Q4835644)
