Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure |
scientific article; zbMATH DE number 7032709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure |
scientific article; zbMATH DE number 7032709 |
Statements
Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (English)
0 references
6 March 2019
0 references
timetabling
0 references
matheuristics
0 references
local search
0 references
robustness
0 references
bi-criteria optimization
0 references
0 references
0 references
0.85332453
0 references
0.8525654
0 references
0.84266466
0 references
0.8387119
0 references
