Combining very large scale and ILP based neighborhoods for a two-level location problem

DOI10.1016/j.ejor.2013.06.010zbMath1317.90161OpenAlexW2079976699MaRDI QIDQ2356178

Alberto Ceselli, Giuliana Carello, Bernardetta Addis

Publication date: 29 July 2015

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

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

zbMATH Keywords

local searchlocationvariable neighborhood searchmatheuristicsvery large scale neighborhood search

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (7)

Multi-level facility location as the maximization of a submodular set function ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ The capacitated mobile facility location problem ⋮ Metaheuristics ``In the large ⋮ Multi-level facility location problems ⋮ Combining very large scale and ILP based neighborhoods for a two-level location problem

Uses Software

• CPLEX
• OR-Library

Cites Work

• Unnamed Item
• Metaheuristics for bi-level optimization
• Solving a continuous local access network design problem with a stabilized central column generation approach
• A survey of very large-scale neighborhood search techniques
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• A review of hierarchical facility location models
• An exact algorithm for the capacitated facility location problems with single sourcing
• Upper and lower bounds for the two-level simple plant location problem
• Local branching
• An exact method for the two-echelon, single-source, capacitated facility location problem
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• Combining very large scale and ILP based neighborhoods for a two-level location problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• Exactly solving a two-level location problem with modular node capacities
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications

This page was built for publication: Combining very large scale and ILP based neighborhoods for a two-level location problem