A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions

@@ Property / cites work @@
+A facet generation and relaxation technique applied to an assignment problem with side constraints
+Normal rank
@@ Property / cites work @@
+A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+The Maximum Weight Connected Subgraph Problem
@@ Property / cites work: The Maximum Weight Connected Subgraph Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Rooted Maximum Node-Weight Connected Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Two ``well-known'' properties of subgradient optimization
+Normal rank
@@ Property / cites work @@
+Q4707782
@@ Property / cites work: Q4707782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495496
@@ Property / cites work: Q4495496 / rank @@
+Normal rank
@@ Property / cites work @@
+A node‐based ILP formulation for the node‐weighted dominating Steiner problem
+Normal rank
@@ Property / cites work @@
+Optimal rectangular partitions
@@ Property / cites work: Optimal rectangular partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Imposing Connectivity Constraints in Forest Planning Models
+Normal rank
@@ Property / cites work @@
+A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Solving Connected Subgraph Problems in Wildlife Conservation
+Normal rank
@@ Property / cites work @@
+A strong lower bound for the Node Weighted Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
+Normal rank
@@ Property / cites work @@
+Efficient cuts in Lagrangean `relax-and-cut' schemes
+Normal rank
@@ Property / cites work @@
+The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
+Normal rank
@@ Property / cites work @@
+Algorithmic expedients for the prize collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangian Relaxation via Ballstep Subgradient Methods
+Normal rank
@@ Property / cites work @@
+A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Non delayed relax-and-cut algorithms
@@ Property / cites work: Non delayed relax-and-cut algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294045
@@ Property / cites work: Q5294045 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual subgradient methods for convex problems
+Normal rank
@@ Property / cites work @@
+Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
+Normal rank
@@ Property / cites work @@
+Conjugate gradient methods using quasi-Newton updates with inexact line searches
+Normal rank
@@ Property / cites work @@
+Q3874241
@@ Property / cites work: Q3874241 / rank @@
+Normal rank
@@ Property / cites work @@
+On imposing connectivity constraints in integer programs
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank