Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Michele Vindigni"'
We consider an online version of the orienteering problem, where stochastic service requests arise during a first time interval from customers located on the nodes of a graph. Every request must be accepted/rejected in real time. Later, a vehicle mus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b46865094073afb8211976f1f29d411
http://hdl.handle.net/11379/547563
http://hdl.handle.net/11379/547563
Publikováno v:
Computers & Operations Research. 82:15-26
A novel time dependent version of the Traveling Purchaser Problem is presented.A LP model introducing constrains to represent dynamically changing quantities is defined.An exact method based on a branch-and-cut algorithm exploiting the structure of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1795ffd0ef55dc14bf655d36062f5dd
https://doi.org/10.1016/j.cor.2017.01.001
https://doi.org/10.1016/j.cor.2017.01.001
Publikováno v:
Computers & Operations Research. 81:269-281
A novel stochastic version of the orienteering problem is considered.The problem generalizes the probabilistic TSP.A deterministic equivalent MILP model is derived.A branch-and-cut procedure with special branching rules is developed.Matheuristic proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dc601f219706f1107b484bbbb91f1e6
https://doi.org/10.1016/j.cor.2016.12.025
https://doi.org/10.1016/j.cor.2016.12.025
Publikováno v:
Università degli Studi di Brescia-IRIS
In this paper, we analyze a dynamic and stochastic variant of the traveling purchaser problem where quantity available for each product in each market decreases over time according to a stochastic process. The multiobjective nature of the problem is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bdf728280eb13816a2209cf40cd2b5b
http://hdl.handle.net/11379/478062
http://hdl.handle.net/11379/478062
In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d95ae8405b9f6b014eec47563829a74c
http://hdl.handle.net/11379/345707
http://hdl.handle.net/11379/345707
Given a set of products each with positive discrete demand, and a set of markets selling products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a subset of markets such that products demand is satisfied at minimum p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::909f116a4667c5852d67fa10059c4a82
http://hdl.handle.net/11379/46477
http://hdl.handle.net/11379/46477
Given a set of products and a set of markets, the traveling purchaser problem looks for a tour visiting a subset of the markets to satisfy products demand at the minimum purchasing and traveling costs. In this paper, we analyze the dynamic variant of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c3b2a2fdd271e11d4489af1621b351
http://hdl.handle.net/11379/28482
http://hdl.handle.net/11379/28482
Publikováno v:
Whitestein Series in Software Agent Technologies ISBN: 3764372370
World-Wide Web technologies and the vision of Semantic Web have pushed for adaptive SW applications to scale up information technologies to the Web, where information is organized following different underlying knowledge and/or presentation models. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd47fd68dcbb0d6d7e09f582384832c2
https://doi.org/10.1007/3-7643-7361-x_3
https://doi.org/10.1007/3-7643-7361-x_3
Publikováno v:
Web Intelligence
Text understanding makes strong assumptions about the conceptualisation of the underlying knowledge domain. This mediates between the accomplishment of the specific task at the one hand and the knowledge expressed in the target text fragments at the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d155142ca58c7ed4388d203c38fe6c6a
https://doi.org/10.1109/wi.2003.1241190
https://doi.org/10.1109/wi.2003.1241190
Autor:
Ben Hachey, Maria Teresa Pazienza, Vangelis Karkaletsis, Dimitris Souflis, Claire Grover, Constantine D. Spyropoulos, Michele Vindigni, José Coch, Emmanuel Cartier
Publikováno v:
Karkaletsis, V, Spyropoulos, C D, Souflis, D, Grover, C, Hachey, B, Pazienza, M T, Vindigni, M, Cartier, E & Coch, J 2003, Demonstration of the CROSSMARC System . in NAACL-Demonstrations '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: Demonstrations . vol. 4, pp. 13-14 . https://doi.org/10.3115/1073427.1073434
HLT-NAACL
HLT-NAACL
The EC-funded R&D project, CROSSMARC, is developing technology for extracting information from domain-specific web pages, employing language technology methods as well as machine learning methods in order to facilitate technology porting to new domai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::705a7b539f8e7c4c8b8c058f103f4b74
https://hdl.handle.net/20.500.11820/5705e653-df6d-4641-b8f8-cb95ba0b3b8c
https://hdl.handle.net/20.500.11820/5705e653-df6d-4641-b8f8-cb95ba0b3b8c