The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
type: Item
instance of: scholarly article
title: The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
zbMATH Open document ID: 1200.65042
author: Tobias Achterberg
author: Christian Raack
published in: Mathematical Programming Computation
publication date: 2010-10-14T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5800250
zbMATH Keywords: mixed integer programming
zbMATH Keywords: network detection
zbMATH Keywords: cut-based inequalities
zbMATH Keywords: S{\texttt{CIP}}
zbMATH Keywords: C{\texttt{PLEX}}
zbMATH Keywords: numerical examples
zbMATH Keywords: graph
zbMATH Keywords: branch-and-cut libraries
describes a project that uses: CPLEX
describes a project that uses: COIN-OR
describes a project that uses: SCIP
describes a project that uses: SNDlib
describes a project that uses: MIPLIB2003
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: MIPLIB
describes a project that uses: Cgl
MaRDI profile type: Publication
full work available at URL: s12532-010-0015-3
OpenAlex ID: W2080560296
cites work: SCIP: solving constraint integer programs
cites work: MIPLIB 2003
cites work: Q3056948
cites work: Flow pack facets of the single node fixed-charge flow polytope
cites work: On capacitated network design cut-set polyhedra
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: Cover and pack inequalities for (mixed) integer programming
cites work: On splittable and unsplittable flow capacitated network design arc-set polyhedra.
cites work: Valid inequalities for problems with additive variable upper bounds
cites work: Facets of the knapsack polytope
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point
cites work: Automatic identification of embedded network rows in large-scale optimization models
cites work: Discrete optimization in public rail transport
cites work: Source sink flows with capacity installation in batches
cites work: A polyhedral approach to multicommodity survivable network design
cites work: Q4198056
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Sequence independent lifting in mixed integer programming
cites work: A branch-and-cut algorithm for capacitated network design problems
cites work: Polyhedral results for the edge capacity polytope.
cites work: Bidirected and unidirected capacity installation in telecommunication networks.
cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
cites work: Shortest paths, single origin‐destination network design, and associated polyhedra
cites work: The convex hull of two core capacitated network design problems
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: The 0-1 knapsack problem with a single continuous variable
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: Q4663414
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
cites work: On cut-based inequalities for capacitated network design polyhedra
cites work: Q5395365
cites work: Valid inequalities for mixed 0-1 programs
cites work: On the \(0/1\) knapsack polytope
cites work: Faces for a linear inequality in 0–1 variables
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
DOI: 10.1007/S12532-010-0015-3
description: scientific article; zbMATH DE number 5800250