Identifying efficient solutions in multiple objective integer monotone programs

MaRDI QIDQ2907857zbMATH OpenFDO

Authors Fatima Bellahcene

Publication date 11 September 2012

Published in Applied Mathematical Sciences (Ruse) (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/ams/ams-2012/ams-25-28-2012/index.html

zbMATH Keywords

domain cutmonotone optimizationmultiobjective integer programmingpolyblock approach

Mathematics Subject Classification ID

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

Recommendations

• Finding integer efficient solutions for multiple objective network programming problems
• scientific article; zbMATH DE number 3934797
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• scientific article; zbMATH DE number 3999655

Cited in

(6)

• A reduction algorithm for integer multiple objective linear programs
• Optimising a nonlinear utility function in multi-objective integer programming
• Finding integer efficient solutions for multiple objective network programming problems
• scientific article; zbMATH DE number 3934797 (Why is no real title available?)
• A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
• Some algebraic methods for solving multiobjective polynomial integer programs

This page was built for publication: Identifying efficient solutions in multiple objective integer monotone programs

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