Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
From MaRDI portal
Publication:4280729
DOI10.1287/trsc.27.2.90zbMath0788.90043OpenAlexW2041621901MaRDI QIDQ4280729
Teodor Gabriel Crainic, Louis Delorme
Publication date: 1993
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.27.2.90
branch-and-boundsharp boundsdual-ascent approachbalancing requirementsfleet of vehiclesmulticommodity location-allocation
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
A tabu search procedure for multicommodity location/allocation with balancing requirements, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Dynamic supply chain design with inventory, Pricing and balancing of the sea-cargo service chain with empty equipment repositioning, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, New facets for the two-stage uncapacitated facility location polytope, Allocation of empty containers between multi-ports, Unnamed Item, An algorithm for the capacitated, multi-commodity multi-period facility location problem., Novel multi-objective resource allocation and activity scheduling for fourth party logistics, Empty container management in a port with long-run average criterion, Positioning empty containers among multiple ports with leasing and purchasing considerations, A branch-and-bound method for multicommodity location with balancing requirements, Planning models for freight transportation, A multiperiod two-echelon multicommodity capacitated plant location problem
