The Offline Group Seat Reservation Knapsack Problem With Profit on Seats

Autor: Igor Deplano, Danial Yazdani, Trung Thanh Nguyen

Publikováno v: IEEE Access, Vol 7, Pp 152358-152367 (2019)

In this paper we present the Group Seat Reservation Knapsack Problem with Profit on Seat. This is an extension of the the Offline Group Seat Reservation Knapsack Problem. In this extension we introduce a profit evaluation dependant on not only the sp

Externí odkaz: https://doaj.org/article/d17c548390f549678432717d3863bdd5

The Offline Group Seat Reservation Knapsack Problem With Profit on Seats

Autor: Trung Thanh Nguyen, Igor Deplano, Danial Yazdani

Publikováno v: IEEE Access, Vol 7, Pp 152358-152367 (2019)

In this paper we present the Group Seat Reservation Knapsack Problem with Profit on Seat. This is an extension of the the Offline Group Seat Reservation Knapsack Problem. In this extension we introduce a profit evaluation dependant on not only the sp

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::deb21b18435f53cba0b5df6c535ad465
https://doi.org/10.1109/access.2019.2948322

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Examination about pattern making program for apparel

Publikováno v: 宮崎大學工學部紀要 = Memoirs of Faculty of Engineering, University of Miyazaki. 40:229-232

In sewing, a (paper) pattern is the paper or cardboard templates from which the parts of a garment are traced onto fabric before cutting out and assembling. In recent years, it has increased to perform the design of such a pattern by CAD software. Ho

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::289f27c8af47162abce3c258d0b0a93a
http://hdl.handle.net/10458/3620

Two-Dimensional Bin Packing Problems

Autor: Andrea Lodi, Michele Monaci, Silvano Martello, Daniele Vigo

Publikováno v: Paradigms of Combinatorial Optimization
Paradigms of Combinatorial Optimization: Problems and New Approaches: 2nd Edition, 107-129
STARTPAGE=107;ENDPAGE=129;TITLE=Paradigms of Combinatorial Optimization: Problems and New Approaches: 2nd Edition
Lodi, A, Martello, S, Monaci, M & Vigo, D 2014, Two-Dimensional Bin Packing Problems . in Paradigms of Combinatorial Optimization: Problems and New Approaches: 2nd Edition . Wiley & Blackwell, pp. 107-129 . https://doi.org/10.1002/9781119005353.ch5

An important variant of two-dimensional bin packing problem (2BP), which is also used in some approximation algorithms for its solution, is the strip packing problem (2SP), in which the items have to be packed in a strip of width W and infinite heigh

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9623a44ad9781729c1e302adcb6d34ae
https://doi.org/10.1002/9781119005353.ch5