Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061): Difference between revisions

Latest revision as of 14:41, 22 July 2024

scientific article

Language	Label	Description	Also known as
English	Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem	scientific article

Statements

instance of

scholarly article

0 references

title

Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (English)

0 references

author

Dilson Lucas Pereira

0 references

Alexandre Salles da Cunha

0 references

published in

European Journal of Operational Research

0 references

publication date

7 May 2020

0 references

zbMATH Keywords

combinatorial optimization

0 references

Dantzig-Wolfe decomposition

0 references

cutting planes

0 references

Lagrangian relaxation

0 references

spanning trees

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2019.12.042

0 references

cites work

Q3989988

0 references

A lift-and-project cutting plane algorithm for mixed 0-1 programs

0 references

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

0 references

Solving the quadratic minimum spanning tree problem

0 references

A characterization of linearizable instances of the quadratic minimum spanning tree problem

0 references

The quadratic minimum spanning tree problem and its variations

0 references

Matroids and the greedy algorithm

0 references

Q4178782

0 references

Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Non delayed relax-and-cut algorithms

0 references

The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm

0 references

Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem

0 references

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

0 references

Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

An effective genetic algorithm approach to the quadratic minimum spanning tree problem

0 references

Identifiers

zbMATH Open document ID

1441.90170

0 references

DOI

10.1016/j.ejor.2019.12.042

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2178061

@@ Property / cites work @@
+Q3989988
@@ Property / cites work: Q3989988 / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+Normal rank
@@ Property / cites work @@
+Solving the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A characterization of linearizable instances of the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The quadratic minimum spanning tree problem and its variations
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Non delayed relax-and-cut algorithms
@@ Property / cites work: Non delayed relax-and-cut algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
+Normal rank
@@ Property / cites work @@
+Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+An effective genetic algorithm approach to the quadratic minimum spanning tree problem
+Normal rank