Goal programming in the context of the assignment problem and a computationally effective solution method
From MaRDI portal
Publication:929411
DOI10.1016/J.AMC.2007.10.044zbMath1279.90152OpenAlexW1974464747MaRDI QIDQ929411
Gholam Reza Jahanshahloo, Mohammad Afzalinejad
Publication date: 17 June 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.044
goal programmingmulti-objective programmingPareto efficiencyassignment problemDantzig-Wolfe reformulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal Estimation of Executive Compensation by Linear Programming
- Decomposition Principle for Linear Programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A branch and bound algorithm for the generalized assignment problem
- Goal programming and Pareto efficiency
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
- Multicriteria Optimization
This page was built for publication: Goal programming in the context of the assignment problem and a computationally effective solution method