A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
From MaRDI portal
Recommendations
Cited in
(12)- A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
- 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
- An interactive procedure for multiple objective integer linear programming problems
- A review of goal programming and its applications
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Grouping algorithm for linear goal programming problems
- scientific article; zbMATH DE number 1086973 (Why is no real title available?)
- A comparison of genetic and conventional methods for the solution of integer goal programmes
- Feature issue: Multiobjective programming and goal programming
- Goal programming model: A glorious history and a promising future
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of 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)