Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
type: Item
instance of: scholarly article
title: Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
zbMATH Open document ID: 1495.90037
author: Y. K. Agarwal
author: Sachin Jayaswal
author: Y. P. Aneja
published in: European Journal of Operational Research
publication date: 2022-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7479784
zbMATH Keywords: networks
zbMATH Keywords: integer programming
zbMATH Keywords: polar duality
zbMATH Keywords: cutting-plane
describes a project that uses: PORTA
describes a project that uses: SSCFLPsolver
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.08.043
OpenAlex ID: W3199547674
cites work: Design of Survivable Networks Using Three- and Four-Partition Facets
cites work: Network loading problem: valid inequalities from 5- and higher partitions
cites work: Fixed charge multicommodity network design using \(p\)-partition facets
cites work: k-Partition-based facets of the network design problem
cites work: Metric inequalities and the network loading problem
cites work: Network Design Using Cut Inequalities
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra
cites work: Fenchel Cutting Planes for Integer Programs
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design
cites work: Accelerating benders decomposition with heuristicmaster problem solutions
cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design
cites work: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: An improved cut-and-solve algorithm for the single-source capacitated facility location problem
cites work: Revisiting Lagrangian relaxation for network design
cites work: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
cites work: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
cites work: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
cites work: Solving the two‐facility network design problem with 3‐partition facets
cites work: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem
cites work: Multi-objective routing within large scale facilities using open finite queueing networks
cites work: Algorithms – ESA 2005
cites work: Combinatorial approaches to multiflow problems
cites work: The convex hull of two core capacitated network design problems
cites work: Q4699379
cites work: Q4040221
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
cites work: A local branching heuristic for the capacitated fixed-charge network design problem
cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem
cites work: An implementation of exact knapsack separation
cites work: Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
DOI: 10.1016/J.EJOR.2021.08.043
description: scientific article; zbMATH DE number 7479784