An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
type: Item
instance of: scholarly article
title: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
zbMATH Open document ID: 1393.90076
author: Peng Zhang
published in: Journal of Global Optimization
publication date: 2018-03-13T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6849595
zbMATH Keywords: global optimization
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: parallel computing
zbMATH Keywords: multicore architectures
zbMATH Keywords: portfolios of relaxations
describes a project that uses: MIPLIB
describes a project that uses: BARON
describes a project that uses: LINDOGlobal
describes a project that uses: XPRESS
describes a project that uses: MINLPLib
describes a project that uses: ANTIGONE
describes a project that uses: SCIP
describes a project that uses: UG
describes a project that uses: LINDO
describes a project that uses: CPLEX
describes a project that uses: ParaSCIP
MaRDI profile type: Publication
full work available at URL: s10898-017-0559-0
OpenAlex ID: W2745993358
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: A finite algorithm for global minimization of separable concave programs
cites work: A review of recent advances in global optimization
cites work: Solving large MINLPs on computational grids
cites work: Introduction to global optimization
cites work: Q3997222
cites work: A hybrid LP/NLP paradigm for global optimization relaxations
cites work: The global solver in the LINDO API
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Global optimization. Scientific and engineering case studies
cites work: A branch-and-reduce approach to global optimization
cites work: Global Optimization and Constraint Satisfaction
cites work: Product disaggregation in global optimization and relaxations of rational programs
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
DOI: 10.1007/S10898-017-0559-0
description: scientific article; zbMATH DE number 6849595