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

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 2017 English Publisher:Elsevier BVJournal:European Journal of Operational Research, volume 260, pages 920-933 (issn: 0377-2217,

Copyright policy )

Authors: CACCHIANI, VALENTINA; D'AMBROSIO, CLAUDIA;

doi: 10.1016/j.ejor.2016.10.015

handle: 11585/590481

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

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Alma Mater Studiorum University of Bologna
Italy
École Polytechnique
France

Keywords

multi-objective, Convex programming, convex mixed integer non-linear programming, Mixed integer programming, Convex Mixed Integer Non-Linear Programming; Heuristic algorithm; Hydro unit commitment; Knapsack problem; Multi-objective; Modeling and Simulation; Management Science and Operations Research; Information Systems and Management, heuristic algorithm, knapsack problem, hydro unit commitment, Approximation methods and heuristics in mathematical programming, Multi-objective and goal programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	18
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average