Pages that link to "Item:Q342082"
From MaRDI portal
The following pages link to Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082):
Displaying 4 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
