TETREES: Trade-off Evaluation Through Refined Exact Epsilon-Constraint Solver
Federica de Trizio et al.
What the paper says
TETREES is an open-source Python framework for multi-objective optimization that implements the exact ɛ -constraint method to compute complete and deterministic Pareto-optimal sets. Its modular architecture decouples objective definition, constraint modeling, and solver configuration, enabling reproducible workflows and seamless integration of new metrics or optimization modules. Built on Gurobi, TETREES supports fine-grained control over branching, heuristics, and search strategies, facilitating scalable exploration of complex decision spaces. A service-to-resource assignment case study illustrates how the framework exposes performance–value trade-offs and enables systematic evaluation of alternative solver configurations, providing a robust software environment for optimization research and decision-support tool development. • Modular design enabling flexible objectives, constraints, and solver control. • Fine-grained solver tuning for branching, heuristics, and search strategies. • Generates full Pareto sets while preserving original problem structure. • Validated on large-scale service–resource assignment with conflicting goals.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.