Locating Satellite Yards in Forestry Operations

DOI10.3138/INFOR.47.3.223MaRDI QIDQ6160212zbMATH OpenFDO

Authors Jean-François Cordeau, G. Laporte

Publication date 9 May 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

capacitated facility location problemforestry operationssatellite yards

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A new method for solving capacitated location problems based on a set partitioning approach
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Dynamic supply chain design with inventory
• Efficient algorithms for the capacitated concentrator location problem
• Facility location and supply chain management. A review
• On the capacitated concentrator location problem: a reformulation by discretization
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• The capacitated plant location problem with multiple facilities in the same site

This page was built for publication: Locating Satellite Yards in Forestry Operations

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