Locating Satellite Yards in Forestry Operations

DOI10.3138/infor.47.3.223MaRDI QIDQ6160212

Gilbert Laporte, Jean-François Cordeau, Unnamed Author

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