The following pages link to (Q3048571):
Displaying 14 items.
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
