Generalized network design problems.
From MaRDI portal
Publication:1810478
DOI10.1016/S0377-2217(02)00404-6zbMath1036.90026OpenAlexW2079125893WikidataQ115202288 ScholiaQ115202288MaRDI QIDQ1810478
Corinne Feremans, Gilbert Laporte, Martine Labbé
Publication date: 9 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00404-6
Related Items
On the minimum routing cost clustered tree problem, On the minimum corridor connection problem and other generalized geometric problems, Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems, The generalized fixed-charge network design problem, Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks, A hub location problem with fully interconnected backbone and access networks, The geometric generalized minimum spanning tree problem with grid clustering, Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, Shortest Paths in Graphs of Convex Sets, Application of Metaheuristics to Large-Scale Transportation Problems, On the complexity of the selective graph coloring problem in some special classes of graphs, A branch-and-price-and-cut method for computing an optimal bramble, Computing optimal shortcuts for networks, The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, Approximation algorithms for group prize-collecting and location-routing problems, An improved hybrid ant-local search algorithm for the partition graph coloring problem, Randomized heuristics for the family traveling salesperson problem, Generalized network design polyhedra, A meta-heuristic approach for solving the urban network design problem
Uses Software
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
- 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
- An improved approximation scheme for the Group Steiner Problem
- 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
- Solving Steiner tree problems in graphs to optimality
- 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
