Pages that link to "Item:Q2490338"

The following pages link to New interval methods for constrained global optimization (Q2490338):

Displaying 33 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
• Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• Some feasibility sampling procedures in interval methods for constrained global optimization (Q506473) (← links)
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
• New enclosure algorithms for the verified solutions of nonlinear Volterra integral equations (Q636538) (← links)
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
• Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
• Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure (Q883194) (← links)
• Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← 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)
• Interval oriented multi-section techniques for global optimization (Q1002180) (← links)
• Solving constrained optimization problems using a novel genetic algorithm (Q1004192) (← links)
• A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
• New interval analysis support functions using gradient information in a global minimization algorithm (Q1411328) (← links)
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests (Q1580430) (← links)
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (Q1583690) (← links)
• Using interval analysis for solving planar single-facility location problems: New discarding tests (Q1595899) (← links)
• On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
• The 1-center problem in the plane with independent random weights (Q2456633) (← links)
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods (Q2568640) (← links)
• An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems (Q2568646) (← links)
• Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
• (Q4455068) (← links)
• (Q4547468) (← links)
• (Q5301189) (← links)
• Deterministic global optimization using interval constraint propagation techniques (Q5693008) (← links)
• Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A Huff-like location model with quality adjustment and/or closing of existing facilities (Q6555174) (← links)