Pages that link to "Item:Q342082"

The following pages link to Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082):

Displaying 9 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)
• 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)
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)