A new research paper explores methods for representing the non-dominated set in multi-objective network problems. The study demonstrates that supported non-dominated points offer high-quality representations, particularly for capacitated network optimization problems, outperforming extreme supported non-dominated points as arc capacities increase. While supported point sets can be large, the research suggests using these supported points as candidate sets for subset selection problems, yielding fixed-size representations of comparable quality to those derived from the complete non-dominated set. AI
IMPACT This research could lead to more efficient methods for solving complex network optimization problems, potentially impacting fields that rely on such optimizations.
RANK_REASON The cluster contains a single academic paper published on arXiv. [lever_c_demoted from research: ic=1 ai=0.4]
Read on arXiv cs.NE (Neural & Evolutionary) →
- arXiv
- Capacitated Network Optimization Problems
- Extreme Supported Non-dominated Points
- Multi-objective Network Problems
- Non-dominated Set
- Subset Selection Problems
- Supported Non-dominated Points
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
