Combinatorial optimization with one quadratic term: spanning trees and forests
From MaRDI portal
Publication:406320
DOI10.1016/J.DAM.2014.05.031zbMATH Open1303.90086OpenAlexW2069579948MaRDI QIDQ406320FDOQ406320
Authors: Christoph Buchheim, Laura Klein 
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.031
Recommendations
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Complete description for the spanning tree problem with one linearised quadratic term
- scientific article; zbMATH DE number 35513
- 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
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Geometric algorithms and combinatorial optimization.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- L’algebre de Boole et ses applications en recherche operationnelle
- Combinatorial optimization with one quadratic term: spanning trees and forests
- 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
- On The Boolean Quadric Forest Polytope
- The cut polytope and the Boolean quadric polytope
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- The complexity of a minimum reload cost diameter problem
- Complete description for the spanning tree problem with one linearised quadratic term
- On minimum changeover cost arborescences
Cited In (14)
- Computational methods for logistics problems related to optimal trees
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- Matroid optimisation problems with nested non-linear monomials in the objective function
- A class of valid inequalities for multilinear 0-1 optimization problems
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Matroid optimization problems with monotone monomials in the objective
- On the path avoiding forbidden pairs polytope
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Complete description for the spanning tree problem with one linearised quadratic term
- The quadratic minimum spanning tree problem and its variations
- Multilinear sets with two monomials and cardinality constraints
Uses Software
This page was built for publication: Combinatorial optimization with one quadratic term: spanning trees and forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406320)
