An exact algorithm for the modular hub location problem with single assignments
type: Item
instance of: scholarly article
title: An exact algorithm for the modular hub location problem with single assignments
zbMATH Open document ID: 1458.90462
author: Moayad Tanash
author: Navneet Vidyarthi
author: Ivan Contreras
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6901447
zbMATH Keywords: hub location
zbMATH Keywords: flow-dependent costs
zbMATH Keywords: Lagrangean relaxation
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2017.03.006
OpenAlex ID: W2602497572
cites work: Network hub location problems: The state of the art
cites work: A generalized subgradient method with relaxation step
cites work: Q4133397
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Branch and price for large-scale capacitated hub location problems with single assignment
cites work: Hub Location as the Minimization of a Supermodular Set Function
cites work: Tight bounds from a path based formulation for the tree of hub location problem
cites work: Q3351135
cites work: Multi-product capacitated single-allocation hub location problems: formulations and inequalities
cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Enumeration and search procedures for a hub location problem with economies of scale
cites work: Projecting the flow variables for hub location problems
cites work: Solving the hub location problem in a star–star network
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: Network cost minimization using threshold-based discounting
cites work: An improved Benders decomposition algorithm for the tree of hubs location problem
cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines
cites work: ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
cites work: Star \(p\)-hub median problem with modular arc capacities
cites work: Solving the hub location problem with modular link capacities
cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
DOI: 10.1016/J.COR.2017.03.006
description: scientific article; zbMATH DE number 6901447