Pages that link to "Item:Q976040"

The following pages link to The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040):

Displaying 16 items.

• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
• 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 and its variations (Q1662110) (← 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)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← 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)
• Complete description for the spanning tree problem with one linearised quadratic term (Q2450761) (← links)
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
• Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
• (Q5743409) (← links)