Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
From MaRDI portal
Publication:2272297
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
Cites work
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- A Spectral Bundle Method for Semidefinite Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- An Interior-Point Method for Semidefinite Programming
- Assignment Problems and the Location of Economic Activities
- Branching rules revisited
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Complete description for the spanning tree problem with one linearised quadratic term
- Cones of Matrices and Set-Functions and 0–1 Optimization
- scientific article; zbMATH DE number 3777779 (Why is no real title available?)
- scientific article; zbMATH DE number 35513 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- LAPACK Users' Guide
- Linear semi-infinite programming theory: an updated survey
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Matroids and the greedy algorithm
- Non delayed relax-and-cut algorithms
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On The Boolean Quadric Forest Polytope
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Solving the quadratic minimum spanning tree problem
- Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The quadratic assignment problem
- The quadratic minimum spanning tree problem and its variations
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- Validation of subgradient optimization
Cited in
(16)- Quadratic lower bounds for algebraic branching programs and formulas
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem
- A quadratic lower bound for homogeneous algebraic branching programs
- On solving the quadratic shortest path problem
- Lower bounds and exact algorithms for the 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
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system
- Semidefinite programming bounds and a branch-and-bound algorithm for the chordless cycle problem
- Branch-and-bound algorithms for the K -cluster problem based on SDP bounds evaluated by Lagrangian relaxation
- The quadratic minimum spanning tree problem: lower bounds via extended formulations
- Quadratically constrained reformulation, strong semidefinite programming bounds, and algorithms for the chordless cycle problem
- Spanning and splitting: integer semidefinite programming for the quadratic minimum spanning tree problem
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)
