A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
From MaRDI portal
Publication:1753510
DOI10.1016/j.ejor.2016.10.015zbMath1403.90597OpenAlexW2533664202MaRDI QIDQ1753510
Valentina Cacchiani, Claudia D'Ambrosio
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.015
knapsack problemheuristic algorithmmulti-objectiveconvex mixed integer non-linear programminghydro unit commitment
Convex programming (90C25) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Bi-objective design-for-control of water distribution networks with global bounds ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ Bi-objective optimisation over a set of convex sub-problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Editorial: Multiple criteria decision making in emergency management
- On finding representative non-dominated points for bi-objective integer network flow problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An approximation algorithm for convex multi-objective programming problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- A multi-criteria optimization model for humanitarian aid distribution
- Heuristic algorithms for the general nonlinear separable knapsack problem
- SCIP: solving constraint integer programs
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Bound sets for biobjective combinatorial optimization problems
- Constrained optimization using multiple objective programming
- Multiobjective optimization. Interactive and evolutionary approaches
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Equity portfolio construction and selection using multiobjective mathematical programming
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Pareto optimality in multiobjective problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Nonlinear multiobjective optimization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multiple criteria decision analysis. State of the art surveys
- Novel multi-objective resource allocation and activity scheduling for fourth party logistics
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- A discussion of scalarization techniques for multiple objective integer programming
- Two phase algorithms for the bi-objective assignment problem
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- A survey of recent developments in multiobjective optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
- Diversity Maximization Approach for Multiobjective Optimization
- Bicriteria Transportation Problem
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Generalized homotopy approach to multiobjective optimization.
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
This page was built for publication: A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
