Exact minimum weight spanners via column generation
From MaRDI portal
Cites work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A Set Partitioning Approach to the Crew Scheduling Problem
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A survey of resource constrained shortest path problems: exact solution approaches
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- Algorithms – ESA 2004
- An exact bidirectional A^ approach for solving resource-constrained shortest path problems
- Approximation algorithms for spanner problems and directed Steiner forest
- Constructing light spanners deterministically in near-linear time
- Efficient algorithms for constructing very sparse spanners and emulators
- Enabling research through the SCIP Optimization Suite 8.0
- Expander graphs and their applications
- Facets of two Steiner arborescence polyhedra
- Fast constructions of lightweight spanners for general graphs
- Flight string models for aircraft fleeting and routing
- Graph spanners
- Graph spanners: a tutorial review
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2064416 (Why is no real title available?)
- Integer Programming
- Light spanners
- Network flows. Theory, algorithms, and applications.
- New state-space relaxations for solving the traveling salesman problem with time windows
- NP-completeness of minimum spanner problems
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- On a multicriteria shortest path problem
- On dynamic shortest paths problems
- On sparse spanners of weighted graphs
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Random Geometric Graphs
- Spanner approximations in practice
- Spanners in graphs of bounded degree
- Testing and reconstruction of Lipschitz functions with applications to data privacy
- Transitive-closure spanners
- Using light spanning graphs for passenger assignment in public transport
This page was built for publication: Exact minimum weight spanners via column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253086)
