A discussion of scalarization techniques for multiple objective integer programming
- 19 August 2006
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 147 (1), 343-360
- https://doi.org/10.1007/s10479-006-0074-z
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path ProblemsPublished by Defense Technical Information Center (DTIC) ,2007
- Optimized Crew Scheduling at Air New ZealandInforms Journal on Applied Analytics, 2001
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000
- Note on combinatorial optimization with max-linear objective functionsDiscrete Applied Mathematics, 1993
- The matroidal knapsack: A class of (often) well-solvable problemsOperations Research Letters, 1984
- Theory and algorithms for linear multiple objective programs with zero–one variablesMathematical Programming, 1979
- Existence of efficient solutions for vector maximization problemsJournal of Optimization Theory and Applications, 1978
- On Computing an Initial Efficient Extreme PointJournal of the Operational Research Society, 1978
- Linear multiple objective programs with zero–one variablesMathematical Programming, 1977
- Finding efficient points for linear multiple objective programsMathematical Programming, 1975