A heuristic for BILP problems: the single source capacitated facility location problem

DOI10.1016/J.EJOR.2014.04.007zbMATH Open1338.90215OpenAlexW2080564020MaRDI QIDQ296777FDOQ296777

Authors: Gianfranco Guastaroba, Maria Grazia Speranza 

Publication date: 23 June 2016

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

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

Recommendations

• scientific article; zbMATH DE number 1187081
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• A heuristic approach to the single facility maximin location problem
• A repeated matching heuristic for the single-source capacitated facility location problem
• A Heuristic for the Capacitated Single Allocation Hub Location Problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• An effective heuristic for large-scale capacitated facility location problems

zbMATH Keywords

binary integer linear programmingheuristic algorithmskernel search frameworksingle source capacitated facility location problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• An exact algorithm for the capacitated facility location problems with single sourcing
• Local branching
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Title not available (Why is that?)
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• Facility location models for distribution system design
• Scatter search for the single source capacitated facility location problem
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Efficient algorithms for the capacitated concentrator location problem
• Upper and lower bounds for the single source capacitated location problem.
• A repeated matching heuristic for the single-source capacitated facility location problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Efficient solution of large scale, single-source, capacitated plant location problems
• Kernel search: a new heuristic framework for portfolio selection
• Kernel search: an application to the index tracking problem
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Pioneering Developments in Location Analysis
• Lagrangean relaxation-based techniques for solving facility location problems
• A cutting plane algorithm for the capacitated facility location problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem

Cited In (20)

• Solving the facility location and fixed charge solid transportation problem
• A heuristic approach to the single facility maximin location problem
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• The capacitated mobile facility location problem
• An efficient heuristic algorithm for the alternative-fuel station location problem
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
• Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
• On single-source capacitated facility location with cost and fairness objectives
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• A dual RAMP algorithm for single source capacitated facility location problems
• A kernel search matheuristic to solve the discrete leader-follower location problem
• A kernel search heuristic for a fair facility location problem
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
• An effective hybrid approach to the two-stage capacitated facility location problem
• Enhanced capacitated facility location problem for mental accounting management using partial resource concentration

This page was built for publication: A heuristic for BILP problems: the single source capacitated facility location problem

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