Exact approaches for the minimum subgraph diameter problem

DOI10.1016/J.COR.2022.106050OpenAlexW4307850734MaRDI QIDQ2108148

Arthur Pratti Dadalto, Mário César San Felice, Fábio Luiz Usberti

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106050

zbMATH Keywords

combinatorial optimizationinteger linear programmingnetwork designbranch-and-cutbenchmark instances

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• New benchmark instances for the capacitated vehicle routing problem
• The non-approximability of bicriteria network design problems
• General network design: a unified view of combined location and network design problems
• Optimum Communication Spanning Trees
• Two algorithms for constructing a Delaunay triangulation
• The complexity of designing a network with minimum diameter
• The complexity of the network design problem
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

This page was built for publication: Exact approaches for the minimum subgraph diameter problem