The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
From MaRDI portal
Publication:1616826
DOI10.1007/s13675-017-0091-5zbMath1400.90057OpenAlexW2769767338MaRDI QIDQ1616826
Mervat Chouman, Bernard Gendron, Teodor Gabriel Crainic
Publication date: 7 November 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-017-0091-5
filteringbranch-and-cutmixed-integer programmingmulticommodity capacitated fixed charge network design
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items
Exact approaches to the single-source network loading problem, A cutting plane algorithm for the capacitated connected facility location problem, The transit time constrained fixed charge multi-commodity network design problem, Minimum‐cost flow problems having arc‐activation costs, Optimal Network Design with End-to-End Service Requirements, Service network design with management and coordination of multiple fleets, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Uses Software
Cites Work
- Unnamed Item
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- The convex hull of two core capacitated network design problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Integer-programming software systems
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Valid inequalities and facets of the capacitated plant location problem
- Capacitated facility location: Separation algorithms and computational experience
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- Branching rules revisited
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Logic, Optimization, and Constraint Programming
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- On cut-based inequalities for capacitated network design polyhedra
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Valid Linear Inequalities for Fixed Charge Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Capacitated Facility Location: Valid Inequalities and Facets
- Network Design Using Cut Inequalities
- Accelerating benders decomposition with heuristicmaster problem solutions
- Algorithms – ESA 2005
- Experiments in mixed-integer linear programming
- Capacitated Network Design—Polyhedral Structure and Computation
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Flow pack facets of the single node fixed-charge flow polytope
