Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs
From MaRDI portal
Publication:6167407
DOI10.1016/j.ejor.2022.11.043MaRDI QIDQ6167407
No author found.
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- A visual interactive method for solving the multiple criteria problem
- A multiple criteria method for choosing among discrete alternatives
- Convex preference cone-based approach for many objective optimization problems
- Interactive algorithms for a broad underlying family of preference functions
- Efficient computation of the search region in multi-objective optimization
- The ``Light Beam Search approach. -- An overview of methodology and applications
- EMOSOR: evolutionary multiple objective optimization guided by interactive stochastic ordinal regression
- Cone contraction and reference point methods for multi-criteria mixed integer optimization
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An improved method for solving multiple criteria problems involving discrete alternatives
- A mathematical basis for satisficing decision making
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Interactive Approaches for Discrete Alternative Multiple Criteria Decision Making with Monotone Utility Functions
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- An interactive approach for multiobjective decision making
- Linear programming with multiple objective functions: Step method (stem)
