Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
From MaRDI portal
Publication:2272297
DOI10.1016/J.EJOR.2019.07.038zbMATH Open1430.90473OpenAlexW2963214284MaRDI QIDQ2272297FDOQ2272297
Authors: Dilson Almeida Guimarães, Alexandre Salles da Cunha, Dilson Lucas Pereira 
Publication date: 9 September 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.038
Recommendations
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- scientific article; zbMATH DE number 1894380
spanning treescombinatorial optimizationsemidefinite programmingsemi-infinite programmingLagrangian relaxation
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Semidefinite programming (90C22)
Cites Work
- LAPACK Users' Guide
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A Spectral Bundle Method for Semidefinite Programming
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Branching rules revisited
- Assignment Problems and the Location of Economic Activities
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Validation of subgradient optimization
- An Interior-Point Method for Semidefinite Programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- An Algorithm for Constrained Optimization with Semismooth Functions
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Title not available (Why is that?)
- Matroids and the greedy algorithm
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- The quadratic assignment problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- The quadratic minimum spanning tree problem and its variations
- Solving the quadratic minimum spanning tree problem
- Title not available (Why is that?)
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- On The Boolean Quadric Forest Polytope
- Non delayed relax-and-cut algorithms
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- Complete description for the spanning tree problem with one linearised quadratic term
- Linear semi-infinite programming theory: an updated survey
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems
Cited In (10)
- On solving the quadratic shortest path problem
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Solving the quadratic minimum spanning tree problem
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system
- Quadratic lower bounds for algebraic branching programs and formulas
- A quadratic lower bound for homogeneous algebraic branching programs
Uses Software
This page was built for publication: Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272297)
