Pages that link to "Item:Q6079879"
From MaRDI portal
The following pages link to A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879):
Displaying 3 items.
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
- Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach (Q6060690) (← links)
- The coupled task scheduling problem: an improved mathematical program and a new solution algorithm (Q6195035) (← links)