Designing sustainable diet plans by solving triobjective integer programs
From MaRDI portal
Publication:6659488
DOI10.1007/S00186-024-00879-8MaRDI QIDQ6659488
Marianna De Santis, Luca Benvenuti, Daniele Patria, Alberto De Santis
Publication date: 9 January 2025
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A general branch-and-bound framework for continuous global multiobjective optimization
- Bi-objective design-for-control of water distribution networks with global bounds
- On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
- Multi-objective integer programming: an improved recursive algorithm
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Advancements in the computation of enclosures for multi-objective optimization problems
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)
