New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141): Difference between revisions

Latest revision as of 01:29, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

author

İbrahim Akgün

0 references

published in

Computers \& Operations Research

0 references

publication date

15 October 2010

0 references

zbMATH Keywords

Miller-Tucker-Zemlin constraints

0 references

spanning trees

0 references

network flows

0 references

integer programming

0 references

hop constraints

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2010.05.003

0 references

cites work

Q3056948

0 references

Packet Routing in Telecommunication Networks with Path and Flow Restrictions

0 references

Using a Hop-Constrained Model to Generate Alternative Communication Network Design

0 references

The 2-hop spanning tree problem

0 references

On the shortest spanning subtree of a graph and the traveling salesman problem

0 references

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

Q4845371

0 references

Solution of a Large-Scale Traveling-Salesman Problem

0 references

Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints

0 references

The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints

0 references

On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems

0 references

Q3714900

0 references

Multicommodity flow models for spanning trees with hop constraints

0 references

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

0 references

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

0 references

New formulations and solution procedures for the hop constrained network design problem.

0 references

Q5294063

0 references

Design of Survivable Networks: A survey

0 references

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

0 references

The Steiner tree problem

0 references

Q3760270

0 references

Modeling and solving the rooted distance-constrained minimum spanning tree problem

0 references

Q4325280

0 references

Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

0 references

An analytical comparison of different formulations of the travelling salesman problem

0 references

Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

0 references

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

0 references

Identifiers

zbMATH Open document ID

1231.90363

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2010.05.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:709141

@@ Property / DOI @@
-.1016/j.cor.2010.05.003
@@ Property / DOI: 10.1016/j.cor.2010.05.003 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.05.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1965140713
@@ Property / OpenAlex ID: W1965140713 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Packet Routing in Telecommunication Networks with Path and Flow Restrictions
+Normal rank
@@ Property / cites work @@
+Using a Hop-Constrained Model to Generate Alternative Communication Network Design
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q3714900
@@ Property / cites work: Q3714900 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+New formulations and solution procedures for the hop constrained network design problem.
+Normal rank
@@ Property / cites work @@
+Q5294063
@@ Property / cites work: Q5294063 / rank @@
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and solving the rooted distance-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4325280
@@ Property / cites work: Q4325280 / rank @@
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+An analytical comparison of different formulations of the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2010.05.003
@@ Property / DOI: 10.1016/J.COR.2010.05.003 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:709141