scientific article; zbMATH DE number 5063984

zbMath1100.90004MaRDI QIDQ5492526

Leo Liberti

Publication date: 13 October 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

symbolic computationbranch-and-boundimplementationsoftware designMINLPvariable neighbourhood searchmultistart

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (24)

Disjunctive Cuts for Nonconvex MINLP ⋮ Symmetry in Mathematical Programming ⋮ An Algorithmic Framework for MINLP with Separable Non-Convexity ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Covering Linear Programming with Violations ⋮ A recipe for finding good solutions to MINLPs ⋮ A storm of feasibility pumps for nonconvex MINLP ⋮ On interval-subgradient and no-good cuts ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ On convex relaxations of quadrilinear terms ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem ⋮ Reformulation in mathematical programming: An application to quantum chemistry ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms

Uses Software

• LGO
• SNOPT
• AMPL
• lp_solve
• CPLEX
• LINDO
• COCONUT
• GAMS
• nag
• gPROMS

This page was built for publication: