Pages that link to "Item:Q2639605"
From MaRDI portal
The following pages link to Solving minimax problems by interval methods (Q2639605):
Displaying 20 items.
- On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- Finding approximate solutions to minimax problems (Q1569265) (← links)
- Interval mathematics, algebraic equations and optimization (Q1593830) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- Efficient solution of interval optimization problem (Q1935954) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic (Q1971068) (← links)
- Development of modal interval algorithm for solving continuous minimax problems (Q2113685) (← links)
- A simplex grey wolf optimizer for solving integer programming and minimax problems (Q2402871) (← links)
- Continuous minimax optimization using modal intervals (Q2465802) (← links)
- Interval method for global solutions of a class of min-max-min problems (Q2479123) (← links)
- (Q3219254) (← links)
- Solving 0-1 Minimax Problems (Q3754438) (← links)
- (Q4392170) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- Direct Gravitational Search Algorithm for Global Optimisation Problems (Q5372051) (← links)