Designing sustainable diet plans by solving triobjective integer programs

DOI10.1007/S00186-024-00879-8MaRDI QIDQ6659488zbMATH OpenFDO

Authors Luca Benvenuti, Alberto De Santis, M. De Santis, Daniele Patria

Publication date 9 January 2025

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00186-024-00879-8

zbMATH Keywords

criterion space algorithmenvironmental sustainabilitymultiobjective integer programming

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• scientific article; zbMATH DE number 1418033
• The \(L\)-shape search method for triobjective integer programming
• Optimising a nonlinear utility function in multi-objective integer programming
• Three algorithms for bicriteria integer linear programs

Cites work

• A decision space algorithm for multiobjective convex quadratic integer optimization
• A general branch-and-bound framework for continuous global multiobjective optimization
• Advancements in the computation of enclosures for multi-objective optimization problems
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
• Bi-objective design-for-control of water distribution networks with global bounds
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Multi-objective integer programming: an improved recursive algorithm
• Multiobjective Integer Programming: Synergistic Parallel Approaches
• On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
• Solving multiobjective mixed integer convex optimization problems
• The \(L\)-shape search method for triobjective integer programming
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs

This page was built for publication: Designing sustainable diet plans by solving triobjective integer programs

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