Pages that link to "Item:Q2026152"
From MaRDI portal
The following pages link to Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree (Q2026152):
Displaying 5 items.
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- Germ order for one-dimensional packings (Q5094170) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
