Potential reduction algorithms for structured combinatorial optimization problems (Q1373458): Difference between revisions

@@ Property / cites work @@
+Q4347846
@@ Property / cites work: Q4347846 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692656
@@ Property / cites work: Q4692656 / rank @@
+Normal rank
@@ Property / cites work @@
+Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
+Normal rank
@@ Property / cites work @@
+Computational experience with an interior point algorithm on the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Q5202849
@@ Property / cites work: Q5202849 / rank @@
+Normal rank
@@ Property / cites work @@
+An interior point algorithm to solve computationally difficult set covering problems
+Normal rank
@@ Property / cites work @@
+Newton’s Method with a Model Trust Region Modification
+Normal rank
@@ Property / cites work @@
+A nonlinear approach to a class of combinatorial optimization problems
+Normal rank
@@ Property / Wikidata QID @@
+Q127098627
@@ Property / Wikidata QID: Q127098627 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(97)00031-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1974010255
@@ Property / OpenAlex ID: W1974010255 / rank @@
+Normal rank