A method for finding the set of non-dominated vectors for multiple objective integer linear programs

@article{Sylva2004AMF,
  title={A method for finding the set of non-dominated vectors for multiple objective integer linear programs},
  author={John Sylva and A. Crema},
  journal={Eur. J. Oper. Res.},
  year={2004},
  volume={158},
  pages={46-55}
}
Abstract An algorithm for enumerating all non-dominated vectors of multiple objective integer linear programs is presented. Using a straightforward theoretical approach, the problem is solved using a sequence of progressively more constrained integer linear programs generating a new solution at each step. The algorithm can also give subsets of efficient solutions that can be useful for designing interactive procedures for large, real-life problems. 
Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
Solving the Multiple Objective Integer Linear Programming Problem
A method for optimizing over the integer efficient set
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
A reduction algorithm for integer multiple objective linear programs
An algorithm for the bi-criterion integer programming problem
Theory and algorithms for linear multiple objective programs with zero–one variables
  • G. Bitran
  • Mathematics, Computer Science
  • Math. Program.
  • 1979
Linear multiple objective programs with zero–one variables
  • G. Bitran
  • Mathematics, Computer Science
  • Math. Program.
  • 1977
A contraction algorithm for the multiparametric integer linear programming problem
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
Multi‐objective combinatorial optimization problems: A survey
...
1
2
3
...