Pages that link to "Item:Q5326788"
From MaRDI portal
The following pages link to Balancing profits and costs on trees (Q5326788):
Displaying 6 items.
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes (Q2208245) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
