Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2010.05.063
+Normal rank
@@ Property / OpenAlex ID @@
+W2067501168
@@ Property / OpenAlex ID: W2067501168 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Algorithmic expedients for the prize collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank