Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Quoc Trung Bui"'
Publikováno v:
Computers & Industrial Engineering. 172:108597
Publikováno v:
Journal of Global Optimization. 74:45-62
We investigate how to partition a rectangular region of length $$L_1$$ and height $$L_2$$ into n rectangles of given areas $$(a_1, \dots , a_n)$$ using two-stage guillotine cuts, so as to minimize either (i) the sum of the perimeters, (ii) the larges
Publikováno v:
KSE
We address a novel variant of the wellknown Traveling Salesman Problem (TSP) called the Traveling Salesman Problem with Hierarchical Objective (TSPHO). In this problem, the customers are divided in to several groups with decreasing priority levels, i
Publikováno v:
Annals of Operations Research, Vol. 238, no.1, p. 1-36 (2016)
We consider in this paper the problems of finding the elementary shortest and longest paths on a graph containing negative and positive cycles. These problems are NP-hard. We propose exact algorithms based on mixed integer programming for their solut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6447dad067c0ab1ebbe5f7e96413d81c
https://hdl.handle.net/2078.1/171841
https://hdl.handle.net/2078.1/171841
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
International Journal on Artificial Intelligence Tools. 26:1750004
Vehicle routing is a class of combinatorial optimization problems arising in the industry of transportation and logistics. The goal of these problems is to compute an optimal route plan for a set of vehicles for serving transport requests of customer
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319070452
CPAIOR
CPAIOR
The quorumcast routing problem is a generalization of multicasting which arises in many distributed applications. It consists of finding a minimum cost tree that spans the source node and at least q out of m specified nodes on a given undirected weig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f46b9cb6a19c70c3b9ef47b45fbd6a75
https://doi.org/10.1007/978-3-319-07046-9_4
https://doi.org/10.1007/978-3-319-07046-9_4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642406263
CP
CP
Agricultural land allocation is a problem that exists in most provinces in Vietnam. Each household owns many disconnected parcels, which reduces agricultural development. The solution to the problem is to repartition this agricutural land among the h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c8e330bf01ab1693679e8a413401f0c
https://doi.org/10.1007/978-3-642-40627-0_55
https://doi.org/10.1007/978-3-642-40627-0_55
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SoICT
Partitioning a field into parcels is one step of the project of merging and repartitioning agricultural lands which emerges in many provinces in Vietnam. Historically, this problem has been conducted based on human experiences and without using optim