A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
type: Item
instance of: scholarly article
title: A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
zbMATH Open document ID: 1403.90597
author: Valentina Cacchiani
author: Claudia D'Ambrosio
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6875822
zbMATH Keywords: multi-objective
zbMATH Keywords: convex mixed integer non-linear programming
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: hydro unit commitment
zbMATH Keywords: knapsack problem
describes a project that uses: AMPL
describes a project that uses: SCIP
describes a project that uses: Ipopt
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.015
OpenAlex ID: W2533664202
cites work: SCIP: solving constraint integer programs
cites work: Bicriteria Transportation Problem
cites work: A criterion space search algorithm for biobjective integer programming: the balanced box method
cites work: A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Pareto optimality in multiobjective problems
cites work: A survey of recent developments in multiobjective optimization
cites work: Heuristic algorithms for the general nonlinear separable knapsack problem
cites work: Multicriteria Optimization
cites work: A discussion of scalarization techniques for multiple objective integer programming
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: Improved \(\varepsilon\)-constraint method for multiobjective programming
cites work: An approximation algorithm for convex multi-objective programming problems
cites work: Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
cites work: Q5692464
cites work: On finding representative non-dominated points for bi-objective integer network flow problems
cites work: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
cites work: Multiple criteria decision analysis. State of the art surveys
cites work: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
cites work: Generalized homotopy approach to multiobjective optimization.
cites work: A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
cites work: Q4821303
cites work: Constrained optimization using multiple objective programming
cites work: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
cites work: A complementarity constraint formulation of convex multiobjective optimization problems
cites work: Novel multi-objective resource allocation and activity scheduling for fourth party logistics
cites work: Finding all nondominated points of multi-objective integer programs
cites work: Q3993418
cites work: Diversity Maximization Approach for Multiobjective Optimization
cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming
cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
cites work: Nonlinear multiobjective optimization
cites work: Two phase algorithms for the bi-objective assignment problem
cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
cites work: A two-phase algorithm for the biobjective integer minimum cost flow problem
cites work: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
cites work: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
cites work: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
cites work: Q4001824
cites work: Q4889471
cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
cites work: Q3760254
cites work: A multi-criteria optimization model for humanitarian aid distribution
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Equity portfolio construction and selection using multiobjective mathematical programming
cites work: Editorial: Multiple criteria decision making in emergency management
DOI: 10.1016/J.EJOR.2016.10.015
description: scientific article; zbMATH DE number 6875822