Complexity of the min-max and min-max regret assignment problems (Q813974): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2004.12.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2039863186
@@ Property / OpenAlex ID: W2039863186 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Complexity of robust single facility location problems on networks with uncertain edge lengths.
+Normal rank
@@ Property / cites work @@
+Minmax regret linear resource allocation problems.
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on shortest path, assignment, and transportation problems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+On the robust shortest path problem.
@@ Property / cites work: On the robust shortest path problem. / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:813974