Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626): Difference between revisions

@@ Property / cites work @@
+Q3989988
@@ Property / cites work: Q3989988 / rank @@
+Normal rank
@@ Property / cites work @@
+The volume algorithm revisited: relation with bundle methods
+Normal rank
@@ Property / cites work @@
+The volume algorithm: Producing primal solutions with a subgradient method
+Normal rank
@@ Property / cites work @@
+Best subset selection via a modern optimization lens
+Normal rank
@@ Property / cites work @@
+Sparse regression: scalable algorithms and empirical performance
+Normal rank
@@ Property / cites work @@
+Q4139967
@@ Property / cites work: Q4139967 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison of bundle and classical column generation
+Normal rank
@@ Property / cites work @@
+Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
+Normal rank
@@ Property / cites work @@
+A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
+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 @@
+ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
+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 @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Lagrangean decomposition: A model yielding stronger lagrangean bounds
+Normal rank
@@ Property / cites work @@
+An application-oriented guide for designing Lagrangean dual ascent algorithms
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex proximal bundle methods in depth: a unified analysis for inexact oracles
+Normal rank
@@ Property / cites work @@
+A tutorial on branch and cut algorithms for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+Q3730365
@@ Property / cites work: Q3730365 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed cardinality stable sets
@@ Property / cites work: Fixed cardinality stable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral results and stronger Lagrangean bounds for stable spanning trees
+Normal rank
@@ Property / cites work @@
+A branch and cut algorithm for minimum spanning trees under conflict constraints
+Normal rank
@@ Property / cites work @@
+A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling 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
@@ links / mardi / name / links / mardi / name @@
+Publication:6110626