From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655): Difference between revisions

@@ Property / cites work @@
+Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+A survey on Benders decomposition applied to fixed-charge network design problems
+Normal rank
@@ Property / cites work @@
+The Benders decomposition algorithm: a literature review
+Normal rank
@@ Property / cites work @@
+Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
+Normal rank
@@ Property / cites work @@
+Benders, metric and cutset inequalities for multicommodity capacitated network design
+Normal rank
@@ Property / cites work @@
+Benders decomposition approach for the robust network design problem with flow bifurcations
+Normal rank
@@ Property / cites work @@
+Exact approaches to the single-source network loading problem
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Programming with linear fractional functionals
@@ Property / cites work: Programming with linear fractional functionals / rank @@
+Normal rank
@@ Property / cites work @@
+Benders-and-cut algorithm for fixed-charge capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts and flows
@@ Property / cites work: Length-bounded cuts and flows / rank @@
+Normal rank