An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron

DOI10.1007/s10898-020-00967-zzbMath1481.90230arXiv2009.12550OpenAlexW3120886587MaRDI QIDQ2052386

Mu-Ming Yang, Wei-Kun Chen, Liang Chen, Yu-Hong Dai

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.12550

zbMATH Keywords

cutting planesexact separationflow arc-set polyhedronunsplittable capacitated network design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Uses Software

• SNDlib
• SCIP
• Knapsack

Cites Work

• Unnamed Item
• An implementation of exact knapsack separation
• Unsplittable non-additive capacitated network design using set functions polyhedra
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• SCIP: solving constraint integer programs
• A computational study of exact knapsack separation for the generalized assignment problem
• Source sink flows with capacity installation in batches
• Polyhedral results for the edge capacity polytope.
• On capacitated network design cut-set polyhedra
• Separation algorithms for 0-1 knapsack polytopes
• Solving the Capacitated Local Access Network Design Problem
• On cut-based inequalities for capacitated network design polyhedra
• Backbone Network Design Tools with Economic Tradeoffs
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Fenchel Cutting Planes for Integer Programs
• A Minimal Algorithm for the Bounded Knapsack Problem
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
• Exploiting Erraticism in Search
• Benchmarking optimization software with performance profiles.

This page was built for publication: An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron