Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements

DOI10.1287/TRSC.27.2.90MaRDI QIDQ4280729zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

balancing requirementsbranch-and-bounddual-ascent approachfleet of vehiclesmulticommodity location-allocationsharp bounds

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• A branch-and-bound method for multicommodity location with balancing requirements
• Dual-ascent methods for large-scale multicommodity flow problems
• A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
• A simple dual ascent algorithm for the multilevel facility location problem
• scientific article; zbMATH DE number 1833402
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• Duality for constrained multifacility location problems with mixed norms and applications

Cited in

(20)

• Planning models for freight transportation
• 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
• A multiperiod two-echelon multicommodity capacitated plant location problem
• Empty container management in a port with long-run average criterion
• A branch-and-bound method for multicommodity location with balancing requirements
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• Novel multi-objective resource allocation and activity scheduling for fourth party logistics
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• Dynamic supply chain design with inventory
• New facets for the two-stage uncapacitated facility location polytope
• Pricing and balancing of the sea-cargo service chain with empty equipment repositioning
• A branch-and-bound algorithm for depot location and container fleet management
• Multicommodity network flows: a survey. I: Applications and formulations
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.
• Allocation of empty containers between multi-ports
• Models for multimode multicommodity location problems with interdepot balancing requirements
• Duality for constrained multifacility location problems with mixed norms and applications
• Positioning empty containers among multiple ports with leasing and purchasing considerations

This page was built for publication: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements

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