Matches in SemOpenAlex for { <https://semopenalex.org/work/W1971036791> ?p ?o ?g. }
- W1971036791 endingPage "379" @default.
- W1971036791 startingPage "367" @default.
- W1971036791 abstract "The quadratic minimum spanning tree problem (QMSTP) consists of finding a spanning tree of a graph G such that a quadratic cost function is minimized. In its adjacent only version (AQMSTP), interaction costs only apply for edges that share an endpoint. Motivated by the weak lower bounds provided by formulations in the literature, we present a new linear integer programming formulation for AQMSTP. In addition to decision variables assigned to the edges, it also makes use of variables assigned to the stars of G . In doing so, the model is naturally linear (integer), without the need of implementing usual linearization steps, and its linear programming relaxation better estimates the interaction costs between edges. We also study a reformulation derived from the new model, obtained by projecting out the decision variables associated with the stars. Two exact solution approaches are presented: a branch‐and‐cut‐and‐price algorithm, based on the first formulation, and a branch‐and‐cut algorithm, based on its projection. Our computational results indicate that the lower bounds introduced here are much stronger than previous bounds in the literature. Being designed for the adjacent only case, our duality gaps are one order of magnitude smaller than the Gilmore–Lawler lower bounds for AQMSTP. As a result, the two exact algorithms introduced here outperform the previous exact solution approaches in the literature. In particular, the branch‐and‐cut method we propose managed to solve AQMSTP instances with as many as 50 vertices to proven optimality. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(4), 367–379 2015" @default.
- W1971036791 created "2016-06-24" @default.
- W1971036791 creator A5014333403 @default.
- W1971036791 creator A5034438662 @default.
- W1971036791 creator A5064768482 @default.
- W1971036791 date "2015-02-02" @default.
- W1971036791 modified "2023-10-13" @default.
- W1971036791 title "Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem" @default.
- W1971036791 cites W1566753057 @default.
- W1971036791 cites W1967987311 @default.
- W1971036791 cites W1986166937 @default.
- W1971036791 cites W1986330908 @default.
- W1971036791 cites W2015718828 @default.
- W1971036791 cites W2020384435 @default.
- W1971036791 cites W2035297690 @default.
- W1971036791 cites W2042442792 @default.
- W1971036791 cites W2048804785 @default.
- W1971036791 cites W2049299385 @default.
- W1971036791 cites W2060514920 @default.
- W1971036791 cites W2075234757 @default.
- W1971036791 cites W2079583273 @default.
- W1971036791 cites W2082782506 @default.
- W1971036791 cites W2084512390 @default.
- W1971036791 doi "https://doi.org/10.1002/net.21580" @default.
- W1971036791 hasPublicationYear "2015" @default.
- W1971036791 type Work @default.
- W1971036791 sameAs 1971036791 @default.
- W1971036791 citedByCount "10" @default.
- W1971036791 countsByYear W19710367912015 @default.
- W1971036791 countsByYear W19710367912016 @default.
- W1971036791 countsByYear W19710367912017 @default.
- W1971036791 countsByYear W19710367912018 @default.
- W1971036791 countsByYear W19710367912020 @default.
- W1971036791 countsByYear W19710367912021 @default.
- W1971036791 crossrefType "journal-article" @default.
- W1971036791 hasAuthorship W1971036791A5014333403 @default.
- W1971036791 hasAuthorship W1971036791A5034438662 @default.
- W1971036791 hasAuthorship W1971036791A5064768482 @default.
- W1971036791 hasConcept C109839438 @default.
- W1971036791 hasConcept C11210021 @default.
- W1971036791 hasConcept C11413529 @default.
- W1971036791 hasConcept C114614502 @default.
- W1971036791 hasConcept C121332964 @default.
- W1971036791 hasConcept C123558587 @default.
- W1971036791 hasConcept C126255220 @default.
- W1971036791 hasConcept C129844170 @default.
- W1971036791 hasConcept C132525143 @default.
- W1971036791 hasConcept C13743678 @default.
- W1971036791 hasConcept C15744967 @default.
- W1971036791 hasConcept C158622935 @default.
- W1971036791 hasConcept C165526019 @default.
- W1971036791 hasConcept C2524010 @default.
- W1971036791 hasConcept C25360446 @default.
- W1971036791 hasConcept C2776029896 @default.
- W1971036791 hasConcept C33923547 @default.
- W1971036791 hasConcept C41045048 @default.
- W1971036791 hasConcept C50797617 @default.
- W1971036791 hasConcept C56086750 @default.
- W1971036791 hasConcept C62520636 @default.
- W1971036791 hasConcept C64331007 @default.
- W1971036791 hasConcept C77805123 @default.
- W1971036791 hasConcept C93693863 @default.
- W1971036791 hasConceptScore W1971036791C109839438 @default.
- W1971036791 hasConceptScore W1971036791C11210021 @default.
- W1971036791 hasConceptScore W1971036791C11413529 @default.
- W1971036791 hasConceptScore W1971036791C114614502 @default.
- W1971036791 hasConceptScore W1971036791C121332964 @default.
- W1971036791 hasConceptScore W1971036791C123558587 @default.
- W1971036791 hasConceptScore W1971036791C126255220 @default.
- W1971036791 hasConceptScore W1971036791C129844170 @default.
- W1971036791 hasConceptScore W1971036791C132525143 @default.
- W1971036791 hasConceptScore W1971036791C13743678 @default.
- W1971036791 hasConceptScore W1971036791C15744967 @default.
- W1971036791 hasConceptScore W1971036791C158622935 @default.
- W1971036791 hasConceptScore W1971036791C165526019 @default.
- W1971036791 hasConceptScore W1971036791C2524010 @default.
- W1971036791 hasConceptScore W1971036791C25360446 @default.
- W1971036791 hasConceptScore W1971036791C2776029896 @default.
- W1971036791 hasConceptScore W1971036791C33923547 @default.
- W1971036791 hasConceptScore W1971036791C41045048 @default.
- W1971036791 hasConceptScore W1971036791C50797617 @default.
- W1971036791 hasConceptScore W1971036791C56086750 @default.
- W1971036791 hasConceptScore W1971036791C62520636 @default.
- W1971036791 hasConceptScore W1971036791C64331007 @default.
- W1971036791 hasConceptScore W1971036791C77805123 @default.
- W1971036791 hasConceptScore W1971036791C93693863 @default.
- W1971036791 hasFunder F4320321091 @default.
- W1971036791 hasFunder F4320322025 @default.
- W1971036791 hasFunder F4320322980 @default.
- W1971036791 hasIssue "4" @default.
- W1971036791 hasLocation W19710367911 @default.
- W1971036791 hasOpenAccess W1971036791 @default.
- W1971036791 hasPrimaryLocation W19710367911 @default.
- W1971036791 hasRelatedWork W134055995 @default.
- W1971036791 hasRelatedWork W1872737999 @default.
- W1971036791 hasRelatedWork W1971036791 @default.
- W1971036791 hasRelatedWork W1981037850 @default.
- W1971036791 hasRelatedWork W2009796757 @default.