An algorithm for the multiple objective integer linear programming problem
type: Item
instance of: scholarly article
title: An algorithm for the multiple objective integer linear programming problem
zbMATH Open document ID: 0477.90075
DOI: 10.1016/0377-2217(82)90182-5
author: Dieter Klein
author: Edward L. Hannan
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3750701
zbMATH Keywords: multiple objective integer linear programming
zbMATH Keywords: integer postoptimality techniques
zbMATH Keywords: implementation
zbMATH Keywords: Balas' additive algorithm
zbMATH Keywords: determination of all efficient solutions
MaRDI profile type: Publication
full work available at URL: 0377-2217(82)90182-5
OpenAlex ID: W2065262885
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Linear multiple objective programs with zero–one variables
cites work: Theory and algorithms for linear multiple objective programs with zero–one variables
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: A revised simplex method for linear multiple objective programs
cites work: Multiparametric Linear Programming
cites work: Q3214706
cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
cites work: Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming
cites work: Discrete right hand side parametrization for linear integer programs
cites work: Integer Programming Post-Optimal Analysis with Cutting Planes
cites work: Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
cites work: Algorithms for the vector maximization problem
cites work: Implicit enumeration based algorithms for postoptimizing zero-one programs
cites work: Postoptimality analysis in zero‐one programming by implicit enumeration
cites work: Problems and methods with multiple objective functions
cites work: Q4082544
cites work: Multicriteria dynamic programming with an application to the integer case
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Q4138487
cites work: Q3875729
description: scientific article; zbMATH DE number 3750701