Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Issmail El Hallaoui"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 6, Iss 2, Pp 185-206 (2018)
Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at e
Externí odkaz:
https://doaj.org/article/70369344f7704cafbe00834a504a623c
Publikováno v:
Production and Manufacturing Research: An Open Access Journal, Vol 6, Iss 1, Pp 90-112 (2018)
The problem of buffer sizing and inspection stations positioning in unreliable production lines is a complex mixed integer nonlinear optimization problem. In this problem, we have a production line with n machines and n fixed-size (storage) buffers i
Externí odkaz:
https://doaj.org/article/8d6286dd91f44229969ee14626e05f58
Publikováno v:
INFORMS Journal on Computing. 34:2313-2331
The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This primal algorithm generates a sequence of integer solutions with decreasing costs, leading to an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f00c92c1e643c9e01c2338ff0c22b68
https://doi.org/10.1287/ijoc.2022.1174
https://doi.org/10.1287/ijoc.2022.1174
Publikováno v:
European Journal of Operational Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb1b42b729b0604cf19084928341a957
https://doi.org/10.1016/j.ejor.2023.04.016
https://doi.org/10.1016/j.ejor.2023.04.016
Publikováno v:
Discrete Applied Mathematics. 306:46-51
For a graph G , the signless Laplacian matrix Q ( G ) is defined as Q ( G ) = D ( G ) + A ( G ) , where A ( G ) is the adjacency matrix of G and D ( G ) the diagonal matrix whose main entries are the degrees of the vertices in G . The Q -spectrum of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::822d648811841a5480910635c6ecdd2a
https://doi.org/10.1016/j.dam.2021.09.019
https://doi.org/10.1016/j.dam.2021.09.019
Publikováno v:
Transportation Science. 55:1411-1429
The crew-pairing problem (CPP) is solved in the first step of the crew-scheduling process. It consists of creating a set of pairings (sequence of flights, connections, and rests forming one or multiple days of work for an anonymous crew member) that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::247a26f8d255f3e8ba7dd17213f9cbd6
https://doi.org/10.1287/trsc.2021.1084
https://doi.org/10.1287/trsc.2021.1084
Publikováno v:
Operations Research Forum. 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ff863ff0c4b4e46eb096dc08876fe5b
https://doi.org/10.1007/s43069-022-00136-w
https://doi.org/10.1007/s43069-022-00136-w
Publikováno v:
Transportation Science. 54:1153-1169
The shortest path problem with resource constraints (SPPRC) is often used as a subproblem within a column-generation approach for routing and scheduling problems. It aims to find a least-cost path between the source and the destination nodes in a net
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5cee599a34162f5edb58f0b905d6b91
https://doi.org/10.1287/trsc.2019.0941
https://doi.org/10.1287/trsc.2019.0941
Publikováno v:
Journal of the Operational Research Society. 72:764-779
Given a set of duties (sequences of activities to be accomplished by a bus driver on a specific day) to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d91da2536a4cfd835a1074bcbc90780a
https://doi.org/10.1080/01605682.2019.1700187
https://doi.org/10.1080/01605682.2019.1700187