The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826): Difference between revisions

@@ Property / DOI @@
-.1007/s13675-017-0091-5
@@ Property / DOI: 10.1007/s13675-017-0091-5 / rank @@
-Normal rank
@@ 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.1007/s13675-017-0091-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2769767338
@@ Property / OpenAlex ID: W2769767338 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated facility location: Separation algorithms and computational experience
+Normal rank
@@ Property / cites work @@
+Capacitated Facility Location: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+Branching rules revisited
@@ Property / cites work: Branching rules revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
+Normal rank
@@ Property / cites work @@
+Flow pack facets of the single node fixed-charge flow polytope
+Normal rank
@@ Property / cites work @@
+On capacitated network design cut-set polyhedra
@@ Property / cites work: On capacitated network design cut-set polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Integer-programming software systems
@@ Property / cites work: Integer-programming software systems / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments in mixed-integer linear programming
@@ Property / cites work: Experiments in mixed-integer linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design—Polyhedral Structure and Computation
+Normal rank
@@ Property / cites work @@
+Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
+Normal rank
@@ Property / cites work @@
+Benders, metric and cutset inequalities for multicommodity capacitated network design
+Normal rank
@@ Property / cites work @@
+Accelerating benders decomposition with heuristicmaster problem solutions
+Normal rank
@@ Property / cites work @@
+A Simplex-Based Tabu Search Method for Capacitated Network Design
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
+Normal rank
@@ Property / cites work @@
+Exact solution of multicommodity network optimization problems with general step cost functions
+Normal rank
@@ Property / cites work @@
+Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
+Normal rank
@@ Property / cites work @@
+Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
+Normal rank
@@ Property / cites work @@
+Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
+Normal rank
@@ Property / cites work @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Logic, Optimization, and Constraint Programming
@@ Property / cites work: Logic, Optimization, and Constraint Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A capacity scaling heuristic for the multicommodity capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Valid inequalities and facets of the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
+Normal rank
@@ Property / cites work @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+On cut-based inequalities for capacitated network design polyhedra
+Normal rank
@@ Property / cites work @@
+A local branching heuristic for the capacitated fixed-charge network design problem
+Normal rank
@@ Property / cites work @@
+Preprocessing and Probing Techniques for Mixed Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4411416
@@ Property / cites work: Q4411416 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Programming Problems Using Automatic Reformulation
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S13675-017-0091-5
@@ Property / DOI: 10.1007/S13675-017-0091-5 / rank @@
+Normal rank