A branch and bound algorithm with constraint partitioning for integer goal programming problems
type: Item
instance of: scholarly article
title: A branch and bound algorithm with constraint partitioning for integer goal programming problems
zbMATH Open document ID: 0436.90104
DOI: 10.1016/0377-2217(80)90194-0
author: S. H. Smith
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3681521
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: constraint partitioning
zbMATH Keywords: integer goal programming
zbMATH Keywords: variable elimination
zbMATH Keywords: linear goal programming
zbMATH Keywords: partitioning algorithm
zbMATH Keywords: multiobjective decision making
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90194-0
OpenAlex ID: W2046954653
cites work: Goal programming and multiple objective optimizations. Part I
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
cites work: A Review of Goal Programming: A Tool for Multiobjective Analysis
cites work: An Automatic Method of Solving Discrete Programming Problems
description: scientific article; zbMATH DE number 3681521