Pages that link to "Item:Q323412"
From MaRDI portal
The following pages link to New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412):
Displaying 3 items.
- Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (Q6496358) (← links)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151) (← links)
- Reliable production process design problem: compact MILP model and ALNS-based primal heuristic (Q6588744) (← links)
