Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689): Difference between revisions

@@ Property / author @@
+Gary A. Kochenberger
@@ Property / author: Gary A. Kochenberger / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / 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/s11590-015-0851-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2108109721
@@ Property / OpenAlex ID: W2108109721 / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally attractive nonlinear models for combinatorial optimisation
+Normal rank
@@ Property / cites work @@
+A new penalty parameter for linearly constrained 0--1 quadratic programming problems
+Normal rank
@@ Property / cites work @@
+\textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
+Normal rank
@@ Property / cites work @@
+Experimental analysis of approximation algorithms for the vertex cover and set covering problems
+Normal rank
@@ Property / cites work @@
+The minimum generalized vertex cover problem
@@ Property / cites work: The minimum generalized vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
+Normal rank
@@ Property / cites work @@
+A parallel algorithm for the minimum weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+An ant colony optimization algorithm for the minimum weight vertex cover problem
+Normal rank