Projecting the flow variables for hub location problems

DOI10.1002/NET.20019MaRDI QIDQ3156823zbMATH OpenOpenAlexFDO

Authors Martine Labbé, Hande Yaman

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)

Recommendations

• Adapting polyhedral properties from facility to hub location problems
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Integer programming formulations of discrete hub location problems
• Projections of the capacitated network loading problem
• On the Two-Level Uncapacitated Facility Location Problem

Cites work

• scientific article; zbMATH DE number 3354799 (Why is no real title available?)
• On the \(p\)-median polytope
• Projections of the capacitated network loading problem
• 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

Cited in

(25)

• A new formulation and branch-and-cut method for single-allocation hub location problems
• Star p-hub median problem with modular arc capacities
• Allocation strategies in hub networks
• Adapting polyhedral properties from facility to hub location problems
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• An M/M/c queue model for hub covering location problem
• Single-allocation ordered median hub location problems
• The double-assignment plant location problem with co-location
• Hub location problems: the location of interacting facilities
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
• An exact algorithm for the modular hub location problem with single assignments
• A branch-and-cut algorithm for the hub location and routing problem
• Stochastic single-allocation hub location
• Network hub location problems: The state of the art
• A conditional p-hub location problem with attraction functions
• A study of the quadratic semi-assignment polytope
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
• Exact and heuristic approaches for the cycle hub location problem
• On hub location problems in geographically flexible networks
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Star p-hub center problem and star p-hub median problem with bounded path lengths
• Multiple allocation hub location with service level constraints for two shipment classes
• Single allocation hub location with heterogeneous economies of scale
• Perspectives on modeling hub location problems

This page was built for publication: Projecting the flow variables for hub location problems

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