A branch and bound algorithm with constraint partitioning for integer goal programming problems

DOI10.1016/0377-2217(80)90194-0zbMath0436.90104OpenAlexW2046954653MaRDI QIDQ1141085

S. H. Smith

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90194-0

zbMATH Keywords

branch and bound algorithmmultiobjective decision makingvariable eliminationpartitioning algorithminteger goal programmingconstraint partitioninglinear goal programming

Mathematics Subject Classification ID

Decision theory (91B06) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

The efficient computer implementation of a large-scale integer goal programming model ⋮ Nonlinear goal programming theory and practice: A survey ⋮ A review of goal programming and its applications ⋮ Multi-period media planning for multi-products incorporating segment specific and mass media

Cites Work

• Goal programming and multiple objective optimizations. Part I
• An Automatic Method of Solving Discrete Programming Problems
• A Review of Goal Programming: A Tool for Multiobjective Analysis
• Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
• A tree-search algorithm for mixed integer programming problems

This page was built for publication: A branch and bound algorithm with constraint partitioning for integer goal programming problems