On nadir points of multiobjective integer programming problems
type: Item
instance of: scholarly article
title: On nadir points of multiobjective integer programming problems
zbMATH Open document ID: 1381.90082
author: Özgür Özpeynirci
published in: Journal of Global Optimization
publication date: 2017-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6816346
zbMATH Keywords: nadir point
zbMATH Keywords: multiobjective integer programming problem
zbMATH Keywords: exact algorithm
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10898-017-0534-9
OpenAlex ID: W2617450314
cites work: An exact method for computing the nadir values in multiple objective linear programming
cites work: Linear programming with multiple objective functions: Step method (stem)
cites work: Outcome space partition of the weight set in multiobjective linear programming
cites work: A naïve approach for solving MCDM problems: the GUESS method
cites work: Nadir Point Estimation Using Evolutionary Approaches: Better Accuracy and Computational Speed Through Focused Search
cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods.
cites work: The interactive analysis of the multicriteria shortest path problem by the reference point method.
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: Computing the nadir point for multiobjective discrete optimization problems
cites work: Finding nadir points in multi-objective integer programs
cites work: A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
cites work: Finding all nondominated points of multi-objective integer programs
cites work: NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point
cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
DOI: 10.1007/S10898-017-0534-9
description: scientific article; zbMATH DE number 6816346