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

DOI10.1504/IJMOR.2012.046690zbMATH Open1251.90274OpenAlexW1986934353MaRDI QIDQ1758882FDOQ1758882

Authors: Moncef Abbas, M. 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

Recommendations

• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Finding non dominated points for multiobjective integer convex programs with linear constraints
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

zbMATH Keywords

branch and boundmulti-objective programmingnon-dominated solutions

Mathematics Subject Classification ID

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

Cited In (9)

• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
• Title not available (Why is that?)
• Preprocessing and cut generation techniques for multi-objective binary programming
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• An exact method to generate all nondominated spanning trees
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Finding non dominated points for multiobjective integer convex programs with linear constraints
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758882)