Generalized network design problems.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 139784 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3278972 (Why is no real title available?)
- scientific article; zbMATH DE number 3298367 (Why is no real title available?)
- scientific article; zbMATH DE number 3335671 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A catalog of steiner tree formulations
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A note on the generalized Steiner tree polytope
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- An improved approximation scheme for the Group Steiner Problem
- Class Steiner trees and VLSI-design
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Generalized Steiner problems and other variants
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Generalized spanning trees
- Network flows. Theory, algorithms, and applications.
- On generalized minimum spanning trees
- On the generalized minimum spanning tree problem
- On the spanning tree polyhedron
- Relaxation methods for the Generalized Minimum Spanning Tree problem
- Solving Steiner tree problems in graphs to optimality
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Some Applications of the Generalized Travelling Salesman Problem
- Some generalizations of the steiner problem in graphs
- Steiner problem in networks: A survey
- The Steiner tree polytope and related polyhedra
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The Steiner tree problem. II: Properties and classes of facets
- The class Steiner minimal tree problem: A lower bound and test problem generation
- The node-weighted steiner tree problem
- The partial constraint satisfaction problem: Facets and lifting theorems
- The shortest path with at most / nodes in each of the series/parallel clusters
- The symmetric generalized traveling salesman polytope
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- Two-edge connected spanning subgraphs and polyhedra
- Vehicle routing with stochastic demands and restricted failures
Cited in
(30)- New models of the generalized fixed-charge network design problem
- A comprehensive survey on the generalized traveling salesman problem
- The multicolored graph realization problem
- scientific article; zbMATH DE number 5831322 (Why is no real title available?)
- scientific article; zbMATH DE number 5831321 (Why is no real title available?)
- Computing optimal shortcuts for networks
- Application of metaheuristics to large-scale transportation problems
- A meta-heuristic approach for solving the urban network design problem
- A branch-and-price-and-cut method for computing an optimal bramble
- On the minimum routing cost clustered tree problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- scientific article; zbMATH DE number 3914111 (Why is no real title available?)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- scientific article; zbMATH DE number 409471 (Why is no real title available?)
- The geometric generalized minimum spanning tree problem with grid clustering
- Generalized network design problems. Modeling and optimization.
- Approximation algorithms for group prize-collecting and location-routing problems
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- Shortest Paths in Graphs of Convex Sets
- On the minimum corridor connection problem and other generalized geometric problems
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Randomized heuristics for the family traveling salesperson problem
- Solving Generalized Networks
- The generalized fixed-charge network design problem
- A hub location problem with fully interconnected backbone and access networks
- 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
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Generalized network design polyhedra
This page was built for publication: Generalized network design problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810478)