Solving partitioning-hub location-routing problem using DCA (Q2358847): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/jimo.2012.8.87
+Normal rank
@@ Property / OpenAlex ID @@
+W2313019448
@@ Property / OpenAlex ID: W2313019448 / rank @@
+Normal rank
@@ Property / cites work @@
+Network hub location problems: The state of the art
+Normal rank
@@ Property / cites work @@
+Q5431821
@@ Property / cites work: Q5431821 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the partitioning-hub location-routing problem
+Normal rank
@@ Property / cites work @@
+Facets of the clique partitioning polytope
@@ Property / cites work: Facets of the clique partitioning polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A continuous approch for globally solving linearly constrained quadratic
+Normal rank
@@ Property / cites work @@
+The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
+Normal rank
@@ Property / cites work @@
+Convex analysis approach to d. c. programming: Theory, algorithms and applications
+Normal rank
@@ Property / cites work @@
+A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
+Normal rank
@@ Property / cites work @@
+An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
+Normal rank