Multi-objective branch and bound
From MaRDI portal
Publication:1753506
DOI10.1016/j.ejor.2017.01.032zbMath1403.90615OpenAlexW2582889117MaRDI QIDQ1753506
Xavier Gandibleux, Anthony Przybylski
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.2017.01.032
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)
Related Items
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Efficient allocation of resources to a portfolio of decision making units ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Limit sets in global multiobjective optimization ⋮ \( \delta\)MOEA/D-AWACD: improving constant-distance-based MOEA/D-AWA using a step function parameter control mechanism ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Operations research for sustainability assessment of products: a review ⋮ B{\&}B method for discrete partial order optimization ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ Incomplete risk-preference information in portfolio decision analysis ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- On the representation of the search region in multi-objective optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- The multicriteria big cube small cube method
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Bound sets for biobjective combinatorial optimization problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Multiobjective optimization. Interactive and evolutionary approaches
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Multiobjective programming and planning
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Covering Pareto sets by multilevel subdivision techniques
- The problem of the optimal biobjective spanning tree
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Finding nadir points in multi-objective integer programs
- Computing the nadir point for multiobjective discrete optimization problems
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Approximation methods in multiobjective programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- An Algorithm for Multiobjective Zero-One Linear Programming
- Constraint Optimization Techniques for Exact Multi-Objective Optimization
- Bicriteria Transportation Problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Multicriteria Optimization
