A comparison of a constraint aggregation and partitioning zero-one goal programming algorithm with the lee and Morris algorithm
- 31 December 1988
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 15 (2) , 97-102
- https://doi.org/10.1016/0305-0548(88)90002-0
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint AggregationJournal of the Operational Research Society, 1987
- A categorized bibliographic survey of goal programmingOmega, 1985
- Operation Research Methodologies in Industrial Engineering: A SurveyA I I E Transactions, 1980
- A branch and bound algorithm with constraint partitioning for integer goal programming problemsEuropean Journal of Operational Research, 1980
- Reporting computational experiments in mathematical programmingMathematical Programming, 1978
- Note—An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable EliminationManagement Science, 1978
- A critical review of comparisons of mathematical programming algorithms and software (1953-1977)Journal of Research of the National Bureau of Standards, 1978
- An Integer Goal Programming Model for Capital Budgeting in HospitalsFinancial Management, 1976
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965