New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller–Tucker–Zemlin constraints (original) (raw)
Related papers
European Journal of Operational Research, 2011
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Computers & Operations Research, 2005
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem
Handbook of Optimization in Telecommunications
Computers & Operations Research, 2010
Minimum spanning tree with hop restrictions
Journal of Algorithms, 2003
Mathematical Programming, 2011
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
European Journal of Operational Research, 2001
FORMULATIONS AND HEURISTICS FOR MINIMAL SPANNING TREES WITH MINIMUM DEGREE CONSTRAINTS
Solving diameter-constrained minimum spanning tree problems by constraint programming
International Transactions in Operational Research, 2010
Generating subtour elimination constraints for the Traveling Salesman Problem
A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem
Review of Business Information Systems (RBIS), 2010
A branch and bound algorithm for the capacitated minimum spanning tree problem
Networks, 1993
2008
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Networks, 2004
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Mathematics, 2018
Maurício Souza, Christophe Duhamel
Networks, 2012
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Computers & Operations Research, 2009
Lower Bounds and Exact Algorithms for the Quadratic Minimum Spanning Tree Problem
Computers & Operations Research, 2015
Degree-Constrained k -Minimum Spanning Tree Problem
Complex., 2020
Operational Research, 2018
Study of Minimum Cost Spanning Tree Implementation on TSP based on complexities of Algorithm
Journal of emerging technologies and innovative research, 2021
Raf. J. of Comp. & Math ’ s. , 2011
Computational results for Constrained Minimum Spanning Trees in Flow Networks
2007
Greedy heuristics for the diameter-constrained minimum spanning tree problem
Journal of Mathematical Sciences, 2009
Improved heuristics for the bounded-diameter minimum spanning tree problem
Soft Computing, 2007
Maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ, 2011
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
iiisci.org
PERFORMANCE ANALYSIS OF MINIMUM SPANNING TREE ALGORITHMS
IAEME PUBLICATION, 2020
The quadratic minimum spanning tree problem: lower bounds via extended formulations
2021
Operations Research Letters, 2020
A two-level solution approach for solving the generalized minimum spanning tree problem
European Journal of Operational Research, 2017
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
Advances in Operations Research, 2011
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter
Lecture Notes in Computer Science, 2009
Networks, 2015
Some Tree Representations for Solving the Degree Constrained Minimum Spanning Tree Problems
Jurnal Sains Mipa Universitas Lampung, 2012