Pages that link to "Item:Q6048198"
From MaRDI portal
The following pages link to Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198):
Displaying 9 items.
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level (Q2821098) (← links)
- (Q4984663) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems (Q6616279) (← links)
- An approximation algorithm for multiobjective mixed-integer convex optimization (Q6616281) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
- Designing sustainable diet plans by solving triobjective integer programs (Q6659488) (← links)
