Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3989988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Boolean Quadric Forest Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization with one quadratic term: spanning trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and exact algorithms for the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective genetic algorithm approach to the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised reformulation-linearization technique for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank

Revision as of 22:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
scientific article

    Statements

    Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    quadratic minimum spanning tree problem
    0 references
    Lagrangian relaxation
    0 references
    reformulation-linearization technique
    0 references
    lower bound
    0 references
    dual-ascent approach
    0 references
    reduced costs
    0 references
    0 references
    0 references

    Identifiers