Pages that link to "Item:Q4509750"
From MaRDI portal
The following pages link to On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems (Q4509750):
Displayed 11 items.
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- Iteratively adaptive regularization in inverse modeling with Bayesian outlook – application on geophysical data (Q5901176) (← links)