On the Quadratic Programming Approach for Hub Location Problems

DOI10.1007/978-0-387-88617-6_7zbMath1172.90340OpenAlexW167203450MaRDI QIDQ3638504

Xiaozheng He, Anthony Chen, Henry X. Liu, Wanpracha Art 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

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

Cites Work

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

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