In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
In the present paper a complete procedure for solving Multiple
Objective Integer Linear Programming Problems is presented. The algorithm
can be regarded as a corrected form and an alternative to the method that
was proposed by Gupta and Malhotra. A numerical illustration is given to
show that this latter can miss some efficient solutions. Whereas, the
algorithm stated bellow determines all efficient solutions without
missing any one.
Matthews and Sumner have proved in [10]
that if is a 2-connected
claw-free graph of order such that /3, then is
Hamiltonian. We say that a graph is almost claw-free if for every vertex
of G, 〈 is 2-dominated and the set of centers of claws of is
an independent set. Broersma [5]
have proved that if is
a 2-connected almost claw-free graph of order such that such that /3, then is Hamiltonian. We generalize these results
by considering the graphs satisfying the following property: for...
Download Results (CSV)