A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
type: Item
instance of: scholarly article
title: A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
zbMATH Open document ID: 1380.90165
author: Trung Hieu Tran
author: M. Paola Scaparra
author: Jesse R. O'Hanley
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
full work available at URL: HMEH EJOR2017.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6835212
zbMATH Keywords: facility location
zbMATH Keywords: large-scale neighborhood search
zbMATH Keywords: multi-exchange heuristic
zbMATH Keywords: hypergraphs
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W2240149037
cites work: Combining very large scale and ILP based neighborhoods for a two-level location problem
cites work: Lagrangean heuristics applied to a variety of large capacitated plant location problems
cites work: Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack 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: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
cites work: A cutting plane algorithm for the capacitated facility location problem
cites work: A heuristic lagrangean algorithm for the capacitated plant location problem
cites work: Lagrangean heuristics for location problems
cites work: Q3941433
cites work: The hypergraph assignment problem
cites work: Flows on hypergraphs
cites work: Scatter search for the single source capacitated facility location problem
cites work: Upper and lower bounds for the single source capacitated location problem.
cites work: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
cites work: Directed hypergraphs and applications
cites work: Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
cites work: A heuristic for BILP problems: the single source capacitated facility location problem
cites work: Efficient solution of large scale, single-source, capacitated plant location problems
cites work: An exact algorithm for the capacitated facility location problems with single sourcing
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: Facility location models for distribution system design
cites work: Location Science
cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
cites work: Equilibrium traffic assignment for large scale transit networks
cites work: VLSN search algorithms for partitioning problems using matching neighbourhoods
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
cites work: A repeated matching heuristic for the single-source capacitated facility location problem
cites work: Large-scale local search heuristics for the capacitated vertexp-center problem
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
cites work: Swapping Applications in a Daily Airline Fleet Assignment
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
cites work: Q3821642
cites work: A cut-and-solve based algorithm for the single-source capacitated facility location problem
DOI: 10.1016/J.EJOR.2017.04.032
description: scientific article; zbMATH DE number 6835212