Zobrazeno 1 - 10
of 10 406
pro vyhledávání: '"[info.info-ro]computer science [cs]/operations research [cs.ro]"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Discrete Algorithms (2023)
We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model. The cops and t
Externí odkaz:
https://doaj.org/article/a26ef561013f4ec393470e6794bf7a35
Publikováno v:
European Journal of Operational Research. 310:552-565
In dial-a-ride systems involving autonomous vehicles circulating along a circuit, a fleet of vehicles must serve clients who request rides between stations of the circuit such that the total number of pickup and drop-off operations is minimized. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d71f669bad55f919bef796f793ad3d9b
https://doi.org/10.1016/j.ejor.2023.03.018
https://doi.org/10.1016/j.ejor.2023.03.018
Publikováno v:
Service Science
Service Science, 2023, 15 (1), pp.3--21. ⟨10.1287/serv.2022.0303⟩
Service Science, 2023, 15 (1), pp.3--21. ⟨10.1287/serv.2022.0303⟩
This paper proposes a matching-and-pricing mechanism for a drivers’ demand-reporting problem in parking-sharing programs in which owners share their private parking slots with drivers. We generate a driver-slot matching solution by a centralized as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::306e0893b94555416aad5b3104a2532c
https://doi.org/10.1287/serv.2022.0303
https://doi.org/10.1287/serv.2022.0303
Publikováno v:
International Journal of Production Research
International Journal of Production Research, In press, pp.1-30. ⟨10.1080/00207543.2023.2172968⟩
International Journal of Production Research, In press, pp.1-30. ⟨10.1080/00207543.2023.2172968⟩
International audience; Food-safety inspection is regularly executed by the government for quality assessment. Evidence from recent research demonstrates that inspection accuracy and consistency are affected by inspection biases that result from an o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61afe8107158132650802bc1d52a2553
https://doi.org/10.1080/00207543.2023.2172968
https://doi.org/10.1080/00207543.2023.2172968
Publikováno v:
Journal of Global Optimization. 86:355-391
According to the structural balance theory, a signed graph is considered structurally balanced when it can be partitioned into a number of modules such that positive and negative edges are respectively located inside and between the modules. In pract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e1d38a0f86668fa6dec06ce09cf7ffe
https://doi.org/10.1007/s10898-023-01270-3
https://doi.org/10.1007/s10898-023-01270-3
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2023, 305 (1), pp.64-84. ⟨10.1016/j.ejor.2022.05.022⟩
European Journal of Operational Research, 2023, 305 (1), pp.64-84. ⟨10.1016/j.ejor.2022.05.022⟩
International audience; Last-mile collection and delivery services often rely on multi-echelon logistic systems with many types of practical spatial, temporal, and resource constraints. We consider three extensions of the basic 2-echelon vehicle rout
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6285119c07b3bb8d16eca4d1e855cb8f
https://doi.org/10.1016/j.ejor.2022.05.022
https://doi.org/10.1016/j.ejor.2022.05.022
Publikováno v:
IEEE Transactions on Emerging Topics in Computational Intelligence
IEEE Transactions on Emerging Topics in Computational Intelligence, In press, pp.1-17. ⟨10.1109/TETCI.2023.3241930⟩
IEEE Transactions on Emerging Topics in Computational Intelligence, In press, pp.1-17. ⟨10.1109/TETCI.2023.3241930⟩
International audience; Utility-rich (e.g., more attractive or safer) route planning on city-scale road networks is a common yet time-consuming task. Although both travel time and utility on edges are time-dependent concurrently in real cases, they a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5af540bed666445aee540b70ac5df1d
https://doi.org/10.1109/tetci.2023.3241930
https://doi.org/10.1109/tetci.2023.3241930
Publikováno v:
ROADEF 2023 : 24ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision
ROADEF 2023 : 24ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2023, Rennes (FRA), France
Transportation Science
Transportation Science, 2023, 57 (1), pp.156-173. ⟨10.1287/trsc.2022.1160⟩
ROADEF 2023 : 24ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2023, Rennes (FRA), France
Transportation Science
Transportation Science, 2023, 57 (1), pp.156-173. ⟨10.1287/trsc.2022.1160⟩
In this paper, we study a paratransit application in which children are transported every day from their homes to their special schools or medical-social establishments. To optimize this transportation system, the establishments collaborate to propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f402054f145602c25c7ab7dd004ccbce
https://doi.org/10.1287/trsc.2022.1160
https://doi.org/10.1287/trsc.2022.1160
Autor:
Jérémy Omer, Tangi Migot
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Discrete Algorithms (2020)
In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function. Finding such vertex ordering has been proved to be an essential step to solve discretizable distance geometry problems (DDGP
Externí odkaz:
https://doaj.org/article/d88c4b97d6914d4e9b72e94b2732a6c2
Publikováno v:
EUROPT 19th Workshop on Advances in Continuous Optimization
EUROPT 19th Workshop on Advances in Continuous Optimization, Jul 2022, Lisbonne, Portugal
EUROPT 19th Workshop on Advances in Continuous Optimization, Jul 2022, Lisbonne, Portugal
Sparse optimization-fitting data with a low-cardinality linear model-is addressed through the minimization of a cardinality-penalized least-squares function, for which dedicated branch-and-bound algorithms clearly outperform generic mixed-integerprog
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c5ab926b1d76153645147234a78426ee
https://hal.science/hal-03661177v2/document
https://hal.science/hal-03661177v2/document
