An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming

[1]  Arthur M. Geoffrion,et al.  Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[2]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .

[3]  John Walker.  An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems , 1978 .

[4]  H. P. Benson,et al.  Existence of efficient solutions for vector maximization problems , 1978 .

[5]  Harold P. Benson,et al.  Vector maximization with two objective functions , 1979 .

[6]  Ching-Lai Hwang,et al.  Methods for Multiple Objective Decision Making , 1979 .

[7]  R. Soland.  MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS* , 1979 .

[8]  M. W. Cooper.  A Survey of Methods for Pure Nonlinear Integer Programming , 1981 .

[9]  G. W. Evans,et al.  An Overview of Techniques for Solving Multiobjective Mathematical Programs , 1984 .

[10]  T. Gal.  On Efficient Sets in Vector Maximum Problems — A Brief Survey , 1986 .

[11]  A. Victor Cabot,et al.  A branch and bound algorithm for solving a class of nonlinear integer programming problems , 1986 .

[12]  Jean-Pierre Crouzeix,et al.  Convergence of a Dinkelbach-type algorithm in generalized fractional programming , 1987, Z. Oper. Research.

[13]  Thomas L. Morin,et al.  A bicriteria mathematical programming model for nutrition planning in developing nations , 1987 .

[14]  Harold P. Benson,et al.  New algorithmic approaches for interactive multiple objective decision-making , 1988 .