Buscar
Mostrando ítems 1-10 de 22550
A proximal solution for a class of extended minimax location problem
(Springer, 2015)
A proximal solution for a class of extended minimax location problem
(Springer, 2015)
Valid inequalities for Lagrangian relaxation in an inventory location problem with stochastic capacity
(PERGAMON-ELSEVIER SCIENCE LTD, 2008)
We developed an efficient heuristic to solve a joint location-distribution-inventory model for a three layered supply chain. A firm must locate distribution centers to supply a commodity to spatially distributed retailers ...
Lagrangean relaxation heuristics for the p-cable-trench problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2012)
We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility ...
Cat swarm optimization with different binarization methods for solving set covering problems
(Springer Verlag, 2016)
Waste Bins Location Problem: a review of recent advances in the storage stage of the Municipal Solid Waste reverse logistic chain
(Elsevier, 2022-03-15)
Municipal Solid Waste systems have important economic, social, and environmental impacts for society. Within the diverse stages of the Municipal Solid Waste reverse logistic chain, the waste bin location problem consists ...
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
(Elsevier, 2019)
The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all ...
Forestry production and logistics planning: an analysis using mixed-integer programming
(ELSEVIER SCIENCE BV, 2005)
This article presents a mathematical model for the problem of production and logistics in the forest industry. Specifically, a dynamic model of mixed-integer programming was formulated to solve three common problems in the ...
A Greedy Randomized Adaptive Search With Probabilistic Learning for solving the Uncapacitated Plant Cycle Location Problem
In this paper, we address the Uncapacitated Plant Cycle Location Problem. It is a location-routing problem aimed at determining a subset of locations to set up plants dedicated to serving customers. We propose a mathematical ...
Green open location-routing problem considering economic and environmental costs
(2016-04-01)
This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP), recently presented in the literature, coupled with the growing need for fuel consumption minimization, ...