Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Christophe Wilbaut"'
Publikováno v:
European Journal of Operational Research. 304:901-911
Publikováno v:
SSRN Electronic Journal.
Publikováno v:
The Palgrave Handbook of Operations Research ISBN: 9783030969349
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::973c6322772e573ca76d966b666c37f5
https://doi.org/10.1007/978-3-030-96935-6_4
https://doi.org/10.1007/978-3-030-96935-6_4
Publikováno v:
CoDIT
The Variable-Sized Bin Packing Problem with Color Constraints (VSBPP-CC) is a generalization of the classical one-dimensional Bin Packing Problem, where bins of different capacities are available for packing a set of items each characterized by a wei
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2021, 125, pp.105080. ⟨10.1016/j.cor.2020.105080⟩
Computers and Operations Research, Elsevier, 2021, 125, pp.105080. ⟨10.1016/j.cor.2020.105080⟩
International audience; Cities suffer from high traffic c ongestion of which one of the main causes is the unorganized pursuit for available parking. Apart from traffic congestion, the blind search for a parking slot causes financial and environmenta
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2013, 40 (4), pp.1109-1121. ⟨10.1016/j.cor.2012.11.009⟩
Computers and Operations Research, Elsevier, 2013, 40 (4), pp.1109-1121. ⟨10.1016/j.cor.2012.11.009⟩
International audience; This paper deals with the optimization of a cross-docking system. It is modeled as a three-stage hybrid flowshop, in which shipments and orders are represented as batches. The first stage corresponds to the receiving docks, th
Publikováno v:
IMA Journal of Management Mathematics
IMA Journal of Management Mathematics, Oxford University Press (OUP), 2016, 27 (1), pp.39-54. ⟨10.1093/imaman/dpu020⟩
IMA Journal of Management Mathematics, Oxford University Press (OUP), 2016, 27 (1), pp.39-54. ⟨10.1093/imaman/dpu020⟩
International audience; The inventory routing problem (IRP) deals with the study of the inter-relationship between two important activities in the supply chain: transportation of commodities and inventory management. In this paper, we study a variant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b301efc12290750cbc81c98c17e9e36
https://hal-uphf.archives-ouvertes.fr/hal-03400808
https://hal-uphf.archives-ouvertes.fr/hal-03400808
Publikováno v:
International Transactions in Operational Research. 19:353-378
In this paper, we deal with the two-scenario max–min knapsack (MNK) problem. First, we consider several formulations of MNK as a mixed integer programming problem. Then, we propose a hybrid method as an alternative to solve the MNK exactly. The app
Publikováno v:
Computers & Operations Research. 39:32-41
Recently several hybrid methods combining exact algorithms and heuristics have been proposed for solving hard combinatorial optimization problems. In this paper, we propose new iterative relaxation-based heuristics for the 0-1 Mixed Integer Programmi
Publikováno v:
Electronic Notes in Discrete Mathematics. 36:883-890
In this paper we propose new hybrid heuristics for the 0-1 mixed integer programming problem, based on the variable neighbourhood decomposition search principle and on exploiting information obtained from a series of relaxations. In the case of a max