Generalized network design problems.

DOI10.1016/S0377-2217(02)00404-6zbMath1036.90026WikidataQ115202288 ScholiaQ115202288MaRDI QIDQ1810478

Gilbert Laporte, Corinne Feremans, Martine Labbé

Publication date: 9 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimization; Network design

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

The generalized fixed-charge network design problem, A hub location problem with fully interconnected backbone and access networks, The geometric generalized minimum spanning tree problem with grid clustering, Approximation algorithms for group prize-collecting and location-routing problems

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spanning tree polyhedron
• Class Steiner trees and VLSI-design
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• The partial constraint satisfaction problem: Facets and lifting theorems
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• The Steiner tree polytope and related polyhedra
• Two-edge connected spanning subgraphs and polyhedra
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The Steiner tree problem. II: Properties and classes of facets
• Generalized spanning trees
• The class Steiner minimal tree problem: A lower bound and test problem generation
• Generalized Steiner problems and other variants
• A note on the generalized Steiner tree polytope
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• Some generalizations of the steiner problem in graphs
• The node-weighted steiner tree problem
• Steiner problem in networks: A survey
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• Vehicle routing with stochastic demands and restricted failures
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• On the generalized minimum spanning tree problem
• The shortest path with at most / nodes in each of the series/parallel clusters
• The symmetric generalized traveling salesman polytope
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A catalog of steiner tree formulations
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• On generalized minimum spanning trees