Two linear approximation algorithms for convex mixed integer nonlinear programming

We present two new algorithms for convex Mixed Integer Nonlinear Programming (MINLP), both based on the well known Extended Cutting Plane (ECP) algorithm proposed by Weterlund and Petersson. Our first algorithm, Refined Extended Cutting Plane (RECP), incorporates additional cuts to the MILP relaxati...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 316; no. 2; pp. 1471 - 1491
Main Authors:	Melo, Wendel, Fampa, Marcia, Raupp, Fernanda
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2022 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Business and Management Combinatorics Cutting Linear programming Management research Mathematical analysis Mixed integer Nonlinear programming Operations research Operations Research/Decision Theory S.i.: Claio 2018 Theory of Computation Brazil Mixed integer nonlinear programming Outer approximation Linear approximation Extended cutting plane
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!