Projecting the flow variables for hub location problems

DOI10.1002/net.20019zbMath1055.90045OpenAlexW2007342782MaRDI QIDQ3156823

Hande Yaman, Martine Labbé

Publication date: 12 January 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/24232

zbMATH Keywords

projectionpolyhedral analysisHub locationdicut inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items

A conditional \(p\)-hub location problem with attraction functions, Robust optimization approach to capacitated single and multiple allocation hub location problems, A branch-and-cut algorithm for the hub location and routing problem, An exact algorithm for the modular hub location problem with single assignments, Single Allocation Hub Location with Heterogeneous Economies of Scale, Exact and heuristic approaches for the cycle hub location problem, On hub location problems in geographically flexible networks, An \(M/M/c\) queue model for hub covering location problem, Multiple allocation hub location with service level constraints for two shipment classes, Allocation strategies in hub networks, A new formulation and branch-and-cut method for single-allocation hub location problems, A specialized branch \& bound \& cut for single-allocation ordered median hub location problems, A multi-objective, hub-and-spoke model to design and manage biofuel supply chains, Star \(p\)-hub median problem with modular arc capacities, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, Network hub location problems: The state of the art, Single-allocation ordered median hub location problems, The double-assignment plant location problem with co-location, Stochastic single-allocation hub location, Perspectives on modeling hub location problems, A study of the quadratic semi-assignment polytope, Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems, Hub Location Problems: The Location of Interacting Facilities

Cites Work

• Unnamed Item
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Projections of the capacitated network loading problem
• On the \(p\)-median polytope