Rounding-based heuristics for nonconvex MINLPS
type: Item
instance of: scholarly article
title: Rounding-based heuristics for nonconvex MINLPS
zbMATH Open document ID: 1257.90059
author: Giacomo Nannicini
author: Pietro Belotti
published in: Mathematical Programming Computation
publication date: 2012-11-27T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/105215
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6110469
zbMATH Keywords: nonconvex mixed-integer nonlinear programs
zbMATH Keywords: initial feasible solution
zbMATH Keywords: improved solution
describes a project that uses: CPLEX
describes a project that uses: MINLPLib
describes a project that uses: BARON
describes a project that uses: Ipopt
describes a project that uses: LINDO
describes a project that uses: Couenne
describes a project that uses: FEASPUMP
MaRDI profile type: Publication
OpenAlex ID: W1991970232
cites work: Canonical Cuts on the Unit Hypercube
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: A feasibility pump for mixed integer nonlinear programs
cites work: Heuristics for convex mixed integer nonlinear programs
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: Variable neighborhood search: Principles and applications
cites work: On interval-subgradient and no-good cuts
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: The feasibility pump
cites work: Local branching
cites work: Tabu Search—Part I
cites work: Information-based branching schemes for binary linear mixed integer problems
cites work: A recipe for finding good solutions to MINLPs
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q4040221
cites work: BARON: A general purpose global optimization software package
cites work: A finite algorithm for global minimization of separable concave programs
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Q4254875
DOI: 10.1007/S12532-011-0032-X
description: scientific article; zbMATH DE number 6110469