A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
type: Item
instance of: scholarly article
title: A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
zbMATH Open document ID: 1358.90068
author: Chase Rainwater
author: Joseph Geunes
author: H. Edwin Romeijn
published in: Journal of Heuristics
publication date: 2017-04-04T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6700347
zbMATH Keywords: neighborhood search
zbMATH Keywords: facility location
zbMATH Keywords: assignment problem
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10732-011-9179-x
OpenAlex ID: W2017899961
cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: A survey of very large-scale neighborhood search techniques
cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
cites work: A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
cites work: Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing
cites work: A heuristic lagrangean algorithm for the capacitated plant location problem
cites work: Lagrangean heuristics for location problems
cites work: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: Neighborhood search heuristics for the uncapacitated facility location problem
cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
cites work: Efficient solution of large scale, single-source, capacitated plant location problems
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: Search Heuristics for Resource Constrained Project Scheduling
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3439711
cites work: The generalized assignment problem with flexible jobs
cites work: On the capacitated vehicle routing problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: Solving the uncapacitated facility location problem using tabu search
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
DOI: 10.1007/S10732-011-9179-X
description: scientific article; zbMATH DE number 6700347