The capacitated distribution and waste disposal problem

DOI10.1016/0377-2217(94)00211-8zbMath0911.90236OpenAlexW2152381971MaRDI QIDQ1266619

Jacqueline M. Bloemhof-Ruwaard, Luk N. Van Wassenhove, Marc Salomon

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/72427

zbMATH Keywords

heuristicsbranch-and-boundlower boundingcapacitated facility locationrelaxationsupper boundingproduct flowsdesign of a distribution networkplants and waste disposal unitswaste flows

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

A stochastic programming model for a tactical solid waste management problem ⋮ A facility location model for logistics systems including reverse flows: the case of remanufacturing activities ⋮ Developing an integrated solid waste management system in western Greece: a dynamic location analysis ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ Research challenges in environmental management ⋮ Multi-level facility location problems ⋮ Formulations and relaxations for a multi-echelon capacitated location-distribution problem ⋮ Supply chain partnerships: Opportunities for operations research ⋮ Exact and heuristic approaches for the locational planning of an integrated solid waste management system ⋮ A two-level network for recycling sand: A case study

Uses Software

• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• A comparison of heuristics and relaxations for the capacitated plant location problem
• ADD-heuristics' starting procedures for capacitated plant location models
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Locational analysis
• On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• An efficient heuristic procedure for the capacitated warehouse location problem
• A branch‐bound algorithm for the capacitated facilities location problem