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):
Displaying 6 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)
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)
