Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

DOI10.1504/IJMOR.2012.046690zbMath1251.90274OpenAlexW1986934353MaRDI QIDQ1758882

Moncef Abbas, Meriem Ait Mehdi, Mohamed El-Amine Chergui

Publication date: 16 November 2012

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2012.046690

zbMATH Keywords

branch and boundmulti-objective programmingnon-dominated solutions

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (3)

Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ An exact method to generate all nondominated spanning trees ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems

This page was built for publication: Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming