Pages that link to "Item:Q2490338"
From MaRDI portal
The following pages link to New interval methods for constrained global optimization (Q2490338):
Displayed 15 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)
- A reliable affine relaxation method for global optimization (Q496103) (← 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)
- 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)
- 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)
- Solving constrained optimization problems using a novel genetic algorithm (Q1004192) (← 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)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)