Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-019-00852-4
@@ Property / DOI: 10.1007/s10898-019-00852-4 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-019-00852-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2982750370
@@ Property / OpenAlex ID: W2982750370 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for the Inverse Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Computational Difficulties of Bilevel Linear Programming
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The partial inverse minimum spanning tree problem when weight increase is forbidden
+Normal rank
@@ Property / cites work @@
+The base-matroid and inverse combinatorial optimization problems.
+Normal rank
@@ Property / cites work @@
+The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
+Normal rank
@@ Property / cites work @@
+Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
+Normal rank
@@ Property / cites work @@
+Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
+Normal rank
@@ Property / cites work @@
+New Branch-and-Bound Rules for Linear Bilevel Programming
+Normal rank
@@ Property / cites work @@
+Weighted inverse minimum spanning tree problems under Hamming distance
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Inverse Spanning-Tree Problem
+Normal rank
@@ Property / cites work @@
+Minimizing a Convex Cost Closure Set
@@ Property / cites work: Minimizing a Convex Cost Closure Set / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm for constraint partial inverse matroid problem with weight increase forbidden
+Normal rank
@@ Property / cites work @@
+Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
+Normal rank
@@ Property / cites work @@
+Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
+Normal rank
@@ Property / cites work @@
+Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
+Normal rank
@@ Property / cites work @@
+Constrained inverse min-max spanning tree problems under the weighted Hamming distance
+Normal rank
@@ Property / cites work @@
+Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
+Normal rank
@@ Property / cites work @@
+Solving Inverse Spanning Tree Problems Through Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
+Normal rank
@@ Property / cites work @@
+Partial inverse assignment problems under \(l_{1}\) norm
+Normal rank
@@ Property / cites work @@
+Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
+Normal rank
@@ Property / cites work @@
+Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
+Normal rank
@@ Property / cites work @@
+An algorithm for inverse minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the partial inverse matroid problem in which weights can only be increased
+Normal rank
@@ Property / DOI @@
+.1007/S10898-019-00852-4
@@ Property / DOI: 10.1007/S10898-019-00852-4 / rank @@
+Normal rank