On the Quadratic Programming Approach for Hub Location Problems

DOI10.1007/978-0-387-88617-6_7MaRDI QIDQ3638504zbMATH OpenOpenAlexFDO

Authors Xiaozheng He, Anthony Chen, Henry X. Liu, Wanpracha A. Chaovalitwongse

Publication date 27 October 2009

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-88617-6_7

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Continuous location (90B85)

Recommendations

• Tight linear programming relaxations of uncapacitated p-hub median problems
• Integer programming formulations of discrete hub location problems
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Hub Location and the p-Hub Median Problem
• Solving large single allocation p-hub problems with two or three hubs

Cites work

• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• A Decomposition Method for Quadratic Zero-One Programming
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A dual algorithm for the uncapacitated hub location problem
• A new linearization technique for multi-quadratic 0-1 programming problems.
• A quadratic integer program for the location of interacting hub facilities
• A simple recipe for concise mixed 0-1 linearizations
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• An improved linearization strategy for zero-one quadratic programming problems
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• Decomposition and linearization for 0-1 quadratic programming
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
• Hub Location and the p-Hub Median Problem
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Lower Bounds for the Hub Location Problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• On tabu search for the location of interacting hub facilities
• On the quadratic assignment problem
• Preprocessing and cutting for multiple allocation hub location problems.
• Solution algorithms for the capacitated single allocation hub location problem
• Solution approaches to hub location problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(4)

• A linear program for the two-hub location problem
• Enumeration and search procedures for a hub location problem with economies of scale
• Solution approaches to hub location problems
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms

This page was built for publication: On the Quadratic Programming Approach for Hub Location Problems

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