A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
From MaRDI portal
Publication:2255968
DOI10.1016/j.ejor.2013.08.001zbMath1305.90368OpenAlexW2045560222WikidataQ59317575 ScholiaQ59317575MaRDI QIDQ2255968
Publication date: 18 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.001
Related Items (55)
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Robust optimization for the cyclic hoist scheduling problem ⋮ Planning sustainable routes: economic, environmental and welfare concerns ⋮ On the representation of the search region in multi-objective optimization ⋮ A multi-criteria approach for hospital capacity analysis ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Distribution based representative sets for multi-objective integer programs ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ On nadir points of multiobjective integer programming problems ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Weighted sum model with partial preference information: application to multi-objective optimization ⋮ Efficient computation of the search region in multi-objective optimization ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ On finding the optimal BDD relaxation ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Computing the nadir point for multiobjective discrete optimization problems
Uses Software
Cites Work
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Solving efficiently the 0-1 multi-objective knapsack problem
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Labeling algorithms for multiple objective integer knapsack problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- On the characterization of noninferior solutions of the vector optimization problem
- Algorithms for nonlinear integer bicriterion problems
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- A discussion of scalarization techniques for multiple objective integer programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multi‐objective combinatorial optimization problems: A survey
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
