A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs

•Convex multiobjective mixed integer nonlinear programming problem.•General branch-and-bound based heuristic algorithm enhanced with a refinement procedure.•Tests on hydro unit commitment and scheduling.•Tests on convex bi-objective mixed integer nonlinear knapsack problem. We study convex multi-obj...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 260; no. 3; pp. 920 - 933
Main Authors:	Cacchiani, Valentina, D’Ambrosio, Claudia
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2017
Subjects:	Convex Mixed Integer Non-Linear Programming Heuristic algorithm Hydro unit commitment Knapsack problem Multi-objective Convex Mixed Integer Non-Linear Programming Multi-objective Heuristic algorithm Hydro unit commitment Knapsack problem
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!