A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-014-0750-x
@@ Property / DOI: 10.1007/s11590-014-0750-x / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+LEMON
@@ Property / describes a project that uses: LEMON / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3104695357
@@ Property / OpenAlex ID: W3104695357 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1424
@@ Property / arXiv ID: 1307.1424 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict analysis in mixed integer programming
@@ Property / cites work: Conflict analysis in mixed integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict graphs in solving integer programming problems
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Determining a Minimum Spanning Tree with Disjunctive Constraints
+Normal rank
@@ Property / cites work @@
+Paths, trees and matchings under disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Matrices with the Edmonds-Johnson property
@@ Property / cites work: Matrices with the Edmonds-Johnson property / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum cost perfect matching problem with conflict pair constraints
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Covering, Packing and Knapsack Problems
@@ Property / cites work: Covering, Packing and Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem with disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Quadratic bottleneck problems
@@ Property / cites work: Quadratic bottleneck problems / rank @@
+Normal rank
@@ Property / cites work @@
+A tutorial on branch and cut algorithms for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the maximum cardinality stable set problem
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+The minimum spanning tree problem with conflict constraints and its variations
+Normal rank
@@ Property / DOI @@
+.1007/S11590-014-0750-X
@@ Property / DOI: 10.1007/S11590-014-0750-X / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2257077