A new extended formulation with valid inequalities for the capacitated concentrator location problem

DOI10.1016/J.EJOR.2019.07.008MaRDI QIDQ2029271zbMATH OpenOpenAlexFDO

Authors Massimo Di Francesco, Manlio Gaudioso, E. Gorgone, Ishwar Murthy

Publication date 3 June 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.07.008

zbMATH Keywords

integer programmingvalid inequalitiesconcentrator location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• On the capacitated concentrator location problem: a reformulation by discretization
• A cutting plane algorithm for the capacitated facility location problem
• Polyhedral analysis for concentrator location problems
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• Weak flow cover inequalities for the capacitated facility location problem

Cites work

• (1,k)-configurations and facets for packing problems
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• A multiplier adjustment technique for the capacitated concentrator location problem
• An algorithm for solving large capacitated warehouse location problems
• An exact algorithm for the capacitated facility location problems with single sourcing
• Efficient algorithms for the capacitated concentrator location problem
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• Locating concentrators in centralized computer networks
• Location Problems Arising in Computer Networks
• New trends in exact algorithms for the \(0-1\) knapsack problem
• On the capacitated concentrator location problem: a reformulation by discretization
• Polyhedral analysis for concentrator location problems
• Upper and lower bounds for the single source capacitated location problem.

Cited in

(3)

• Efficient algorithms for the capacitated concentrator location problem
• Formulations and valid inequalities for the capacitated dispersion problem
• On the capacitated concentrator location problem: a reformulation by discretization

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: A new extended formulation with valid inequalities for the capacitated concentrator location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029271)