AMIGO

swMATH2425MaRDI QIDQ14965FDOQ14965

Author name not available (Why is that?)

Cited In (9)

• Branch-and-Bound interval global optimization on shared memory multiprocessors
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
• A back-iteration method for reconstructing chaotic sequences in finite-precision machines
• Location equilibria for a continuous competitive facility location problem under delivered pricing
• Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

This page was built for software: AMIGO