The following pages link to (Q3989988):
Displaying 21 items.
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- On type-2 fuzzy weighted minimum spanning tree (Q2100494) (← 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)
- Complete description for the spanning tree problem with one linearised quadratic term (Q2450761) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)
