Pages that link to "Item:Q1702825"
From MaRDI portal
The following pages link to A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825):
Displaying 11 items.
- On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Special cases of the quadratic shortest path problem (Q1743483) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)
