Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719): Difference between revisions

@@ Property / DOI @@
-.1002/net.20053
@@ Property / DOI: 10.1002/net.20053 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20053
@@ Property / full work available at URL: https://doi.org/10.1002/net.20053 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4241786443
@@ Property / OpenAlex ID: W4241786443 / rank @@
+Normal rank
@@ Property / cites work @@
+The balanced linear programming problem
@@ Property / cites work: The balanced linear programming problem / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Most and least uniform spanning trees
@@ Property / cites work: Most and least uniform spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Multicommodity Flow Approach to the Crew Rostering Problem
+Normal rank
@@ Property / cites work @@
+A multi-level bottleneck assignment approach to the bus drivers' rostering problem
+Normal rank
@@ Property / cites work @@
+-Approximation algorithm for bottleneck disjoint path matching
+Normal rank
@@ Property / cites work @@
+A Column Generation Approach for Large-Scale Aircrew Rostering Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+Approximating disjoint-path problems using packing integer programs
+Normal rank
@@ Property / cites work @@
+Q2777025
@@ Property / cites work: Q2777025 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Balanced optimization problems
@@ Property / cites work: Balanced optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for the uniform balanced network flow problem
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a network
@@ Property / cites work: Disjoint paths in a network / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NET.20053
@@ Property / DOI: 10.1002/NET.20053 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4667719