scientific article

From MaRDI portal
Publication:2776481

zbMath1005.90013MaRDI QIDQ2776481

Anita Schöbel, Stefan Nickel, Tim Sonneborn

Publication date: 28 February 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (33)

A tabu-search based heuristic for the hub covering problem over incomplete hub networksTight bounds from a path based formulation for the tree of hub location problemA conditional \(p\)-hub location problem with attraction functionsRobust optimization approach to capacitated single and multiple allocation hub location problemsMulti-product capacitated single-allocation hub location problems: formulations and inequalitiesThe hub location and pricing problemModelling and analysis of hub-and-spoke networks under stochastic demand and congestionBenders decomposition applied to profit maximizing hub location problem with incomplete hub networkA branch-and-cut algorithm for the hub location and routing problemReliable single allocation hub location problem under hub breakdownsThe impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniquesSingle Allocation Hub Location with Heterogeneous Economies of ScaleHub Location as the Minimization of a Supermodular Set FunctionMultiple allocation tree of hubs location problem for non-complete networksIls-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocationAllocation strategies in hub networksA parallel adaptive memory algorithm for the capacitated modular hub location problemAn alternative approach to address uncertainty in hub locationHub and spoke network design with single-assignment, capacity decisions and balancing requirementsA Benders Decomposition for Hub Location Problems Arising in Public TransportMulti-period hub network design problems with modular capacitiesProprietor and customer costs in the incomplete hub location-routing network topologyNetwork hub location problems: The state of the artLocation of speed-up subnetworksAdapting polyhedral properties from facility to hub location problemsOracle-based algorithms for binary two-stage robust optimizationStochastic single-allocation hub locationFlow shipment scheduling in an incomplete hub location-routing network design problemModeling congestion and service time in hub location problemsA bi-objective incomplete hub location-routing problem with flow shipment schedulingUpgrading arcs to minimize the maximum travel time in a networkA Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity LevelsThe tree of hubs location problem




This page was built for publication: