Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Machine Learning for Multi Objective Convex Separable Programming (MOCSP) with Aggregation of Linear Approximations and Portfolio Optimization
Saved in:
| Published in: | Foundations of Computing and Decision Sciences |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Machine Learning for Multi Objective Convex Separable Programming (MOCSP) with Aggregation of Linear Approximations and Portfolio Optimization
- Linear Programming Solutions to the Linear Ordering Problem in Major American Sports
- MOPOA: A New Multi-Objective Pufferfish Optimization Algorithm
- An adaptive kernel width convex combination method for maximum correntropy criterion
- Linear Programming Transportation Assignment Problem for Parametric Information-Decentralised Energy Market Model
- Improved ordering and aggregation operators for circular intuitionistic fuzzy sets in multi-criteria decision-making
- Two-level approximation method for standard profile selection and topology optimization