Solving zero-one multiple objective programs through implicit enumeration
type: Item
instance of: scholarly article
title: Solving zero-one multiple objective programs through implicit enumeration
zbMATH Open document ID: 0503.90086
DOI: 10.1016/0377-2217(83)90157-1
author: E. P. Winkofsky
author: Richard F. Deckro
published in: European Journal of Operational Research
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3793798
zbMATH Keywords: implicit enumeration based algorithm
zbMATH Keywords: all efficient points
zbMATH Keywords: zero-one, multi-objective program
zbMATH Keywords: extensive computational data
MaRDI profile type: Publication
full work available at URL: 0377-2217(83)90157-1
OpenAlex ID: W2039987877
cites work: Linear programming with multiple objective functions: Step method (stem)
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: Generating all maximal efficient faces for multiple objective linear programs
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: Solving Bicriterion Mathematical Programs
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming
cites work: Q4133412
cites work: Linear multiobjective programming
cites work: Q4105958
cites work: Q4138487
cites work: An Interactive Programming Method for Solving the Multiple Criteria Problem
description: scientific article; zbMATH DE number 3793798