Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
DOI10.1016/0305-0548(91)90037-RzbMath0737.90056OpenAlexW1965849340MaRDI QIDQ1174273
Publication date: 25 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90037-r
approximate representation of the noninferior setbiobjective locationbiobjective mixed- integer linear programming
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Linear programming (90C05) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (15)
Cites Work
- Unnamed Item
- Zero-one programming with multiple criteria
- A multicriteria approach to the location of public facilities
- Finding efficient solutions for rectilinear distance location problems efficiently
- Multiobjective programming and planning
- Determination of efficient points in multiple-objective location problems
- An interactive weighted Tchebycheff procedure for multiple objective programming
This page was built for publication: Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem