Solving diameter-constrained minimum spanning tree problems by constraint programming (original) (raw)

Greedy heuristics for the diameter-constrained minimum spanning tree problem

Cristina Requejo

Journal of Mathematical Sciences, 2009

View PDFchevron_right

Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints

Ibrahim Akgün

Computers & Operations Research, 2010

View PDFchevron_right

Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter

Patvardhan Chellapilla

Lecture Notes in Computer Science, 2009

View PDFchevron_right

An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem

Tamer F. Abdelmaguid

Mathematics, 2018

View PDFchevron_right

Improved heuristics for the bounded-diameter minimum spanning tree problem

alok singh

Soft Computing, 2007

View PDFchevron_right

FORMULATIONS AND HEURISTICS FOR MINIMAL SPANNING TREES WITH MINIMUM DEGREE CONSTRAINTS

Pedro Martins

View PDFchevron_right

A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem

rakesh kawatra

Review of Business Information Systems (RBIS), 2010

View PDFchevron_right

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Luidi Simonetti

Mathematical Programming, 2011

View PDFchevron_right

Degree-Constrained k -Minimum Spanning Tree Problem

Pablo Adasme

Complex., 2020

View PDFchevron_right

A branch and bound algorithm for the capacitated minimum spanning tree problem

kavindra malik

Networks, 1993

View PDFchevron_right

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

Maurício Souza, Christophe Duhamel

Networks, 2012

View PDFchevron_right

Effective Heuristics for the Bi-objective Euclidean Bounded Diameter Minimum Spanning Tree Problem

V Prem Prakash

Communications in Computer and Information Science, 2018

View PDFchevron_right

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Günther Raidl

Advances in Operations Research, 2011

View PDFchevron_right

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Günther Raidl

Proceedings of the 2003 ACM symposium on Applied computing - SAC '03, 2003

View PDFchevron_right

Benchmark problem generators and results for the multiobjective degree-constrained minimum spanning tree problem

Joshua Knowles

2001

View PDFchevron_right

Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem

V Prem Prakash

Informatica (Slovenia), 2015

View PDFchevron_right

New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller–Tucker–Zemlin constraints

Ibrahim Akgün

Computers & Operations Research, 2011

View PDFchevron_right

Lower Bounds and Exact Algorithms for the Quadratic Minimum Spanning Tree Problem

Michel Gendreau

Computers & Operations Research, 2015

View PDFchevron_right

New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints

Ibrahim Akgün

European Journal of Operational Research, 2011

View PDFchevron_right

The Diameter and Maximum Link of the Minimum Routing Cost Spanning Tree Problem

Wiwin Susanty

Science and Technology Indonesia

View PDFchevron_right

Minimum spanning tree with hop restrictions

Refael Hassin

Journal of Algorithms, 2003

View PDFchevron_right

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

Cristina Requejo

Annals of Operations Research, 2006

View PDFchevron_right

On the minimum diameter spanning tree problem

Arie Tamir

Information Processing Letters, 1995

View PDFchevron_right

Lagrangian Relax-and-Cut and Hybrid Methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

Günther Raidl

2008

View PDFchevron_right

Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development

Nguyen Trong Nghia B1911320

Greedy Algorithms, 2008

View PDFchevron_right

VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

Mauricio Souza

Computers & Operations Research, 2009

View PDFchevron_right

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

M. Labbe

Networks, 2004

View PDFchevron_right

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem

Cristina Requejo

Handbook of Optimization in Telecommunications

View PDFchevron_right

New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem

NGUYEN TRI DUC

2009

View PDFchevron_right

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms

Cristina Requejo

Operational Research, 2018

View PDFchevron_right

At least version of the generalized minimum spanning tree problem

Andrei Horvat-Marc

Carpathian Journal of Mathematics

View PDFchevron_right