Pages that link to "Item:Q4509750"

The following pages link to On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems (Q4509750):

Displaying 16 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)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← 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)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← 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)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)