Pages that link to "Item:Q4346866"
From MaRDI portal
The following pages link to Towards finding global representations of the efficient set in multiple objective mathematical programming (Q4346866):
Displaying 26 items.
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Global search perspectives for multiobjective optimization (Q377750) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes (Q681288) (← links)
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods (Q877666) (← links)
- Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
- Norm-based approximation in multicriteria programming. (Q1416300) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Quasi-Newton methods for multiobjective optimization problems (Q1728407) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- Retrieval and use of the balance set in multiobjective global optimization (Q1962989) (← links)
- A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems (Q2192025) (← links)
- A radial boundary intersection aided interior point method for multi-objective optimization (Q2282318) (← links)
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization (Q2349520) (← links)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- 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)
- On parametric representations of the efficient set of multiple objective mathematical programming problems (Q2993671) (← links)
- Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems (Q3627781) (← links)
- (Q4963438) (← links)
- Combining discrete and continuous information for multi-criteria optimization problems (Q6616275) (← links)
