A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360): Difference between revisions

@@ Property / DOI @@
-.1007/s10288-013-0231-6
@@ Property / DOI: 10.1007/s10288-013-0231-6 / rank @@
-Normal rank
@@ Property / author @@
-Paolo Toth
@@ Property / author: Paolo Toth / rank @@
-Normal rank
@@ Property / author @@
+Paolo Toth
@@ Property / author: Paolo Toth / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62048276
@@ Property / Wikidata QID: Q62048276 / rank @@
+Normal rank
@@ 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.1007/s10288-013-0231-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2163551942
@@ Property / OpenAlex ID: W2163551942 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10288-013-0231-6
@@ Property / DOI: 10.1007/S10288-013-0231-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2441360