Solving the minimum labeling global cut problem by mathematical programming
From MaRDI portal
Cites work
- A hybrid metaheuristic for the minimum labeling spanning tree problem
- A polyhedral approach to the generalized minimum labeling spanning tree problem
- A tight quasi-polynomial bound for \textsc{Global Label Min-Cut}
- Approximating minimum label s-t cut via linear programming
- Approximation and hardness results for label cut and related problems
- Colored cut games
- Combinatorial optimization in networks with shared risk link groups
- Edge-colored graphs with applications to homogeneous faults
- Efficient Algorithms for the Label Cut Problems
- Efficient heuristics for the minimum labeling global cut problem
- Facets of the clique partitioning polytope
- Formal Methods for Components and Objects
- Graph theory with applications
- scientific article; zbMATH DE number 2147947 (Why is no real title available?)
- Maximum cuts in edge-colored graphs
- Minimum label \(s\)-\(t\) cut has large integrality gaps
- New algorithms for the minimum coloring cut problem
- On the minimum label spanning tree problem
- Refined parameterizations for computing colored cuts in edge-colored graphs
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
- The edge-labeled survivable network design problem: formulations and branch-and-cut
- The label cut problem with respect to path length and label frequency
- The parameterized complexity of some minimum label problems
- Valid inequalities for the \(k\)-color shortest path problem
This page was built for publication: Solving the minimum labeling global cut problem by mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889526)
