Branch-and-cut-and-price for capacitated connected facility location
type: Item
instance of: scholarly article
title: Branch-and-cut-and-price for capacitated connected facility location
zbMATH Open document ID: 1235.90093
author: Markus Leitner
author: Günther R. Raidl
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2012-02-21T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6008320
zbMATH Keywords: connected facility location
zbMATH Keywords: network design
zbMATH Keywords: branch-and-cut
zbMATH Keywords: branch-and-cut-and-price
zbMATH Keywords: mixed integer programming
Wikidata QID: Q57705371
describes a project that uses: Knapsack
describes a project that uses: CPLEX
describes a project that uses: SCIP
MaRDI profile type: Publication
full work available at URL: s10852-011-9153-5
OpenAlex ID: W2061566537
cites work: Conflict analysis in mixed integer programming
cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
cites work: Dual-based local search for the connected facility location and related problems
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: On implementing the push-relabel method for the maximum flow problem
cites work: Q3351135
cites work: Column Generation
cites work: Q3579459
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: MIP models for connected facility location: a theoretical and computational study
cites work: Provisioning a virtual private network
cites work: Approximation algorithms for connected facility location problems
cites work: The General Steiner Tree-Star problem.
cites work: Solving the simple plant location problem by genetic algorithm
cites work: A Branch and Cut Algorithm for a Steiner Tree-Star Problem
cites work: Modelling the hop constrained connected facility location problem on layered graphs
cites work: Q4845371
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Primal-dual algorithms for connected facility location problems
cites work: Steiner problem in networks: A survey
DOI: 10.1007/S10852-011-9153-5
description: scientific article; zbMATH DE number 6008320