A new extended formulation with valid inequalities for the capacitated concentrator location problem
type: Item
instance of: scholarly article
title: A new extended formulation with valid inequalities for the capacitated concentrator location problem
zbMATH Open document ID: 1487.90435
author: Massimo Di Francesco
author: Manlio Gaudioso
author: E. Gorgone
author: Ishwar Murthy
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7354509
zbMATH Keywords: integer programming
zbMATH Keywords: concentrator location
zbMATH Keywords: valid inequalities
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.07.008
OpenAlex ID: W2960000661
cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
cites work: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
cites work: An algorithm for solving large capacitated warehouse location problems
cites work: Location Problems Arising in Computer Networks
cites work: A multiplier adjustment technique for the capacitated concentrator location problem
cites work: Upper and lower bounds for the single source capacitated location problem.
cites work: On the capacitated concentrator location problem: a reformulation by discretization
cites work: An exact algorithm for the capacitated facility location problems with single sourcing
cites work: Polyhedral analysis for concentrator location problems
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: (1,k)-configurations and facets for packing problems
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: Locating concentrators in centralized computer networks
cites work: INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
cites work: A cut-and-solve based algorithm for the single-source capacitated facility location problem
DOI: 10.1016/J.EJOR.2019.07.008
description: scientific article; zbMATH DE number 7354509