scientific article
From MaRDI portal
Publication:3989988
DOI<399::AID-NAV3220390309>3.0.CO;2-0 10.1002/1520-6750(199204)39:3<399::AID-NAV3220390309>3.0.CO;2-0zbMath0769.90078MaRDI QIDQ3989988
Publication date: 28 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (22)
Reload cost trees and network design ⋮ 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 ⋮ The quadratic minimum spanning tree problem and its variations ⋮ Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem ⋮ Solving the quadratic minimum spanning tree problem ⋮ Combinatorial optimization with one quadratic term: spanning trees and forests ⋮ Polyhedral results and stronger Lagrangean bounds for stable spanning trees ⋮ An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint ⋮ The minimum spanning tree problem with conflict constraints and its variations ⋮ A characterization of linearizable instances of the quadratic minimum spanning tree problem ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Complete description for the spanning tree problem with one linearised quadratic term ⋮ Quadratic bottleneck problems ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item ⋮ On type-2 fuzzy weighted minimum spanning tree
Cites Work
This page was built for publication:
