A review of interactive methods for multiobjective integer and mixed-integer programming

Aksoy, 1990, An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming, Naval Research Logistics, 37, 403, 10.1002/nav.3800370305 Alves, 1999, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, European Journal of Operational Research, 117, 565, 10.1016/S0377-2217(98)00269-0 Alves, 2000, An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, European Journal of Operational Research, 124, 478, 10.1016/S0377-2217(99)00183-6 Alves, 2000, An interactive method for 0–1 multiobjective problems using simulated annealing and tabu search, Journal of Heuristics, 6, 385, 10.1023/A:1009686616612 Alves, 2001, Multiobjective mixed-integer programming, vol. III, 466 Benayoun, 1971, Linear programming with multiple objective functions: Step method (STEM), Mathematical Programming, 1, 366, 10.1007/BF01584098 Bitran, 1977, Linear multiple objective programs with zero–one variables, Mathematical Programming, 13, 121, 10.1007/BF01584332 Bitran, 1979, Theory and algorithms for linear multiple objective programs with zero–one variables, Mathematical Programming, 17, 362, 10.1007/BF01588256 Bitran, 1982, A combined approach to solve binary multicriteria problems, Naval Research Logistics Quarterly, 29, 181, 10.1002/nav.3800290202 Bowman, 1976, On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives, vol. 130, 76 Chalmet, 1986, An algorithm for the bi-criterion integer programming problem, European Journal of Operational Research, 25, 292, 10.1016/0377-2217(86)90093-7 Clímaco, 2004, Multicriteria analysis in telecommunication network planning and design – problems and issues, 899 Clímaco, 1997, Multicriteria integer programming: An overview of the different algorithmic approaches, 248 Deckro, 1983, Solving zero–one multiple objective programs through implicit enumeration, European Journal of Operational Research, 12, 362, 10.1016/0377-2217(83)90157-1 Durso, 1992, An interactive combined branch-and-bound/Tchebycheff algorithm for multiple criteria optimization, 107 Ehrgott, 2000, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spektrum, 22, 425, 10.1007/s002910000046 Evans, 1984, An overview of techniques for solving multiobjective mathematical programs, Management Science, 30, 1268, 10.1287/mnsc.30.11.1268 Ferreira, C. Problemas de localização e distribuição multicritério – aproximações e estudo de alguns casos com implicações ambientais. PhD Thesis (In Portuguese). University of Aveiro, Portugal, 1997. Ferreira, 1996, Multiobjective location of unwelcome or central facilities involving environmental aspects: A prototype of a decision support system, Belgian Journal of Operations Research, Statistics and Computer Science, 36, 159 Feyerabend, 1975 Gabbani, 1986, An interactive heuristic approach for multi-objective integer-programming problems, Journal of the Operational Research Society, 37, 285, 10.1057/jors.1986.46 Gonzalez, 1985, An interactive procedure for solving multiple objective integer linear programming problems, vol. 242, 250 Karaivanova, 1993, An interactive procedure for multiple objective integer linear programming problems, European Journal of Operational Research, 68, 344, 10.1016/0377-2217(93)90190-X Karaivanova, 1995, A reference direction approach to multiple objective integer linear programming, European Journal of Operational Research, 81, 176, 10.1016/0377-2217(93)E0168-W Karwan, 1985, An improved interactive multicriteria integer programming algorithm, vol. 242, 261 Kato, 1998, An interactive fuzzy satisficing method for large scale multiobjective 0–1 programming problems with fuzzy parameters through genetic algorithms, European Journal of Operational Research, 107, 590, 10.1016/S0377-2217(97)00157-4 Kiziltan, 1983, An algorithm for multiobjective zero–one linear programming, Management Science, 29, 1444, 10.1287/mnsc.29.12.1444 Klein, 1982, An algorithm for the multiple objective integer linear programming problem, European Journal of Operational Research, 9, 378, 10.1016/0377-2217(82)90182-5 Korhonen, 1988, A Pareto Race, Naval Research Logistics, 35, 615, 10.1002/1520-6750(198812)35:6<615::AID-NAV3220350608>3.0.CO;2-K Lewandowski, A., Wierzbicki, A. Aspiration based decision analysis and support. Part I: Theoretical and methodological backgrounds. Working paper WP-88-03, IIASA, Laxenburg, Austria, 1988. L’Hoir, H., Teghem, J. Portfolio selection by MOLP using an interactive branch and bound. Foundations of Computing and Decision Sciences 1995; 20 (3); Institute of Computing Science, Technical University of Poznan, Poland. Marcotte, 1980 Marcotte, 1986, An interactive branch-and-bound algorithm for multiple criteria optimization, Management Science, 32, 61, 10.1287/mnsc.32.1.61 Mavrotas, 1998, A branch and bound algorithm for mixed zero–one multiple objective linear programming, European Journal of Operational Research, 107, 530, 10.1016/S0377-2217(97)00077-5 Narula, 1994, An interactive algorithm for solving multiple objective integer linear programming problems, European Journal of Operational Research, 79, 443, 10.1016/0377-2217(94)90058-2 Pasternak, 1973, Bicriterion mathematical programs with Boolean variables, 327 Ramesh, 1990, An interactive method for bicriteria integer programming, IEEE Transactions on Systems, Man, and Cybernetics, 20, 395, 10.1109/21.52550 Ramesh, 1986, A class of practical interactive branch and bound algorithms for multicriteria integer programming, European Journal of Operational Research, 26, 161, 10.1016/0377-2217(86)90168-2 Rasmussen, 1986, Zero–one programming with multiple criteria, European Journal of Operational Research, 26, 83, 10.1016/0377-2217(86)90161-X Roy, 1987, Meaning and validity of interactive procedures as tools for decision making, European Journal of Operational Research, 31, 297, 10.1016/0377-2217(87)90039-7 Sakawa, 1998, An interactive fuzzy satisficing method for multiobjective integer programming problems through genetic algorithms, 94 Shin, 1994, An interactive paired comparison method for bicriterion integer programming, Naval Research Logistics, 41, 423, 10.1002/1520-6750(199404)41:3<423::AID-NAV3220410308>3.0.CO;2-E Soland, 1979, Multicriteria optimization: A general characterization of efficient solutions, Decision Sciences, 10, 26, 10.1111/j.1540-5915.1979.tb00004.x Solanki, 1991, Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem, Computers and Operations Research, 18, 1, 10.1016/0305-0548(91)90037-R Steuer, 1977, An interactive multiple objective linear programming procedure, TIMS Studies in the Mangement Sciences, 6, 225 Steuer, 1986 Steuer, 1983, An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming, 26, 326, 10.1007/BF02591870 Steuer, 1993, A combined Tchebycheff/aspiration criterion vector interactive multiobjective programming procedure, Management Science, 39, 1255, 10.1287/mnsc.39.10.1255 Sylva, 2004, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, European Journal of Operational Research, 158, 46, 10.1016/S0377-2217(03)00255-8 Teghem, 1986, A survey of techniques for finding efficient solutions to multi-objective integer linear programming, Asia-Pacific Journal of Operational Research, 3, 95 Teghem, 1986, Interactive methods for multi-objective integer linear programming, vol. 273, 75 Vassilev, 1993, A reference direction algorithm for solving multiple objective integer linear programming problems, Journal of the Operational Research Society, 44, 1201, 10.1057/jors.1993.199 Villareal, 1981, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Mathematical Programming, 21, 204, 10.1007/BF01584241 Villarreal, 1980, An interactive branch and bound procedure for multicriterion integer linear programming, vol. 177, 448 White, 1984, A branch and bound method for multi-objective boolean problems, European Journal of Operational Research, 15, 126, 10.1016/0377-2217(84)90056-0 White, 1985, A multiple objective interactive Lagrangean relaxation approach, European Journal of Operational Research, 19, 82, 10.1016/0377-2217(85)90311-X Wierzbicki, 1982, A mathematical basis for satisficing decision making, Mathematical Modelling, 3, 391, 10.1016/0270-0255(82)90038-0 Wierzbicki, 1986, On the completeness and constructiveness of parametric characterizations to vector optimization problems, OR Spectrum, 8, 73, 10.1007/BF01719738 Zionts, 1983, An interactive multiple objective linear programming method for a class of underlying nonlinear utility functions, Management Science, 29, 519, 10.1287/mnsc.29.5.519