The minimum cost perfect matching problem with conflict pair constraints (Q340285): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6652545
@@ Property / zbMATH DE Number: 6652545 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matching problem
@@ Property / zbMATH Keywords: matching problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+conflict pairs
@@ Property / zbMATH Keywords: conflict pairs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+conflict graph
@@ Property / zbMATH Keywords: conflict graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+assignment problem
@@ Property / zbMATH Keywords: assignment problem / 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.1016/j.cor.2012.10.022
+Normal rank
@@ Property / OpenAlex ID @@
+W1977673015
@@ Property / OpenAlex ID: W1977673015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:340285