Pages that link to "Item:Q4744077"
From MaRDI portal
The following pages link to An interactive weighted Tchebycheff procedure for multiple objective programming (Q4744077):
Displaying 50 items.
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming (Q2267661) (← links)
- Comparison of some scalarization methods in multiobjective optimization (Q2272601) (← links)
- Generalized multiobjective robustness and relations to set-valued optimization (Q2279632) (← links)
- Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality (Q2284639) (← links)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria (Q2346914) (← links)
- Integrating DEA-oriented performance assessment and target setting using interactive MOLP methods (Q2378392) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- Interactive meta-goal programming (Q2432841) (← links)
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization (Q2433453) (← links)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- Compromise programming with Tchebycheff norm for discrete stochastic orders (Q2449367) (← links)
- Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection (Q2480250) (← links)
- QoE-driven resource allocation for mobile IP services in wireless network (Q2515457) (← links)
- Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization (Q2564162) (← links)
- A CHIM-based interactive Tchebycheff procedure for multiple objective decision making (Q2581598) (← links)
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
- A combined scalarization method for multi-objective optimization problems (Q2666683) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
- Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences (Q2865176) (← links)
- An integrated approach for stock evaluation and portfolio optimization (Q2903132) (← links)
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization (Q2976144) (← links)
- A multi-objective optimization using distribution characteristics of reference data for reverse engineering (Q3018041) (← links)
- Finding integer efficient solutions for multiple objective network programming problems (Q3087624) (← links)
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm (Q3225088) (← links)
- INTEGRATING PROMETHEEII WITH THE TCHEBYCHEFF FUNCTION FOR MULTI CRITERIA DECISION MAKING (Q3585095) (← links)
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
- Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems (Q3627781) (← links)
- Analisis de sensibilidad de las soluciones del problema lineal multiple ordenado (Q4022745) (← links)
- ε-approximate solutions in multiobjective optimization (Q4227987) (← links)
- An interactive decision framework for multiple objective production planning (Q4230298) (← links)
- Robustness of the interactive weighted Tchebycheff Procedure to inaccurate preference information (Q4269760) (← links)
- Indifference sets of reference points in multi-objective integer linear programming (Q4329624) (← links)
- Integrated model for supplier selection and negotiation in a make-to-order environment (Q4671329) (← links)
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization (Q5005859) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems (Q5326806) (← links)
- Integrating a bi-objective paradigm to tolerance optimization (Q5444582) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- Using objective values to start multiple objective linear programming algorithms (Q5925865) (← links)
- Minimax reference point approach and its application for multiobjective optimisation (Q5928446) (← links)
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. (Q5929428) (← links)
- MCDA and preference disaggregation in group decision support systems. (Q5932050) (← links)
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems (Q6046880) (← links)
- Coupling distinct MOLP interactive approaches with a novel DEA hybrid model (Q6060654) (← links)
