Pages that link to "Item:Q2434285"
From MaRDI portal
The following pages link to On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285):
Displaying 12 items.
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
- From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Edge constrained Eulerian extensions (Q6629114) (← links)
