A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
DOI10.2307/2582400zbMATH Open0618.90088OpenAlexW4249903752MaRDI QIDQ3755247FDOQ3755247
Authors: Sang M. Lee, Richard L. Luebbe 
Publication date: 1987
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2582400
Recommendations
Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)
Cited In (12)
- A comparison of genetic and conventional methods for the solution of integer goal programmes
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Title not available (Why is that?)
- Goal programming model: A glorious history and a promising future
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A multicriteria decision-making approach to university resource allocations and information infrastructure planning
- A review of goal programming and its applications
- Grouping algorithm for linear goal programming problems
- An interactive procedure for multiple objective integer linear programming problems
- Feature issue: Multiobjective programming and goal programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
This page was built for publication: A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755247)
