Back to Search
Start Over
Projecting the flow variables for hub location problems
- Source :
- Networks, Networks, Wiley, 2004, 44, pp.84-93
- Publication Year :
- 2004
- Publisher :
- Wiley, 2004.
-
Abstract
- We consider two formulations for the uncapacitated hub location problem with single assignment (UHL), which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the projection cones. Then we investigate whether the corresponding inequalities define facets of the UHL polyhedron. We also present two families of facet defining inequalities that dominate some projection inequalities. Finally, we derive a family of valid inequalities that generalizes the facet defining inequalities and that can be separated in polynomial time. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 84–93 2004
- Subjects :
- Facet (geometry)
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
Computer Networks and Communications
0211 other engineering and technologies
02 engineering and technology
Hub location problem
Combinatorics
Polyhedron
0502 economics and business
Projection
Projection (set theory)
Time complexity
ComputingMilieux_MISCELLANEOUS
Projections
Mathematics
Hub location
050210 logistics & transportation
021103 operations research
05 social sciences
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Multi-commodity flow problem
Flow (mathematics)
Hardware and Architecture
Polyhedral analysis
Assignment problem
Dicut inequalities
Software
Information Systems
Subjects
Details
- ISSN :
- 00283045 and 10970037
- Volume :
- 44
- Database :
- OpenAIRE
- Journal :
- Networks
- Accession number :
- edsair.doi.dedup.....94e6658a1fcc37d58a9747a1723d8eab
- Full Text :
- https://doi.org/10.1002/net.20019