المؤلفون: Irving Barragan-Vite, Joselito Medina-Marin, Norberto Hernandez-Romero, Gustavo Erick Anaya-Fuentes

المصدر: Applied Sciences, Vol 14, Iss 18, p 8172 (2024)

مصطلحات موضوعية: cutting problem, packing problem, Petri net, reachability tree, beam search, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999

وصف الملف: electronic resource

Relation: https://www.mdpi.com/2076-3417/14/18/8172; https://doaj.org/toc/2076-3417

URL الوصول: https://doaj.org/article/021d277f0d8b4270aa00c4bff1fd23d4

المؤلفون: Asano, Takao

المساهمون: Takao Asano

مصطلحات موضوعية: cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.68

الاتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2021.68
https://nbn-resolving.org/urn:nbn:de:0030-drops-155011
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.68

المؤلفون: Asano, Takao, Umeda, Hiroyuki

المساهمون: Takao Asano and Hiroyuki Umeda

مصطلحات موضوعية: cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.15

الاتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2020.15
https://nbn-resolving.org/urn:nbn:de:0030-drops-133599
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.15

المؤلفون: Weiping Pan

المصدر: IEEE Access, Vol 7, Pp 136882-136891 (2019)

مصطلحات موضوعية: Corner-occupying pattern, constrained two-dimensional guillotine cutting problem, heuristic algorithm, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

وصف الملف: electronic resource

Relation: https://ieeexplore.ieee.org/document/8845593/; https://doaj.org/toc/2169-3536

URL الوصول: https://doaj.org/article/d42e310fbb5a40cbabc98daef4059d5c

المؤلفون: Fayard, D., Hifi, M., Zissimopoulos, V.

المصدر: The Journal of the Operational Research Society, 1998 Dec 01. 49(12), 1270-1277.

URL الوصول: https://www.jstor.org/stable/3010152

المؤلفون: Hifi, M., Zissimopoulos, V.

المصدر: The Journal of the Operational Research Society, 1997 Mar 01. 48(3), 324-331.

URL الوصول: https://www.jstor.org/stable/3010432

المؤلفون: Petunin, A.

المصدر: IFAC-PapersOnLine

مصطلحات موضوعية: BASIC CUTTING SEGMENT, CNC SHEET CUTTING MACHINES, DISCRETIZATION OF MODEL, GENERAL OPTIMIZATION MODEL, GENERALIZED SCCP, GTSP, ICP, SEGMENT CONTINUES CUTTING PROBLEM (SCCP), TOOL PATH PROBLEM, “DYNAMIC” CONSTRAINTS, MACHINERY, METAL CUTTING, OPTIMIZATION, SHEET METAL, CUTTING PROBLEMS, DISCRETIZATIONS, GENERAL OPTIMIZATIONS, TOOLPATHS, CUTTING EQUIPMENT

وصف الملف: application/pdf

Relation: Petunin A. General model of tool path problem for the CNC sheet cutting machines / A. Petunin. — DOI 10.1016/j.ifacol.2019.11.609 // IFAC-PapersOnLine. — 2019. — Vol. 13. — Iss. 52. — P. 2662-2667.; https://doi.org/10.1016/j.ifacol.2019.11.609; 436377cf-b925-49ef-ad90-8ce76e3d379d; http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85078881584; http://elar.urfu.ru/handle/10995/92266; 85078881584; 000504282400450

الاتاحة: http://elar.urfu.ru/handle/10995/92266
https://doi.org/10.1016/j.ifacol.2019.11.609
http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85078881584

المؤلفون: MRAD, Mehdi, G. ALI, Tamer, BALMA, Ali, GHARBI, Anis, SAMHAN, Ali, LOULY, M. A.

المصدر: Volume: 22, Issue: 1-10
The Eurasia Proceedings of Educational and Social Sciences

مصطلحات موضوعية: Social, Integer programming,Arc-flow formulation,Strip cutting problem,Graph compression, Sosyal

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c92629efabf6ae849a0d4d3c1bdcf40
https://doi.org/10.55549/epess.1040517

المؤلفون: Sousa, Carla Cristina Ramos Guimarães de

المساهمون: Lopes, Manuel Pereira, Repositório Científico do Instituto Politécnico do Porto

مصطلحات موضوعية: Problemas de corte bidimensional, Problemas de corte e empacotamento, Programação inteira, Two-dimensional cutting problem, Cutting stock problems, Integer programming

وصف الملف: application/pdf

الاتاحة: http://hdl.handle.net/10400.22/2777

المؤلفون: Khachai, Daniil

المساهمون: Bordeaux, Detienne, Boris, Battaïa, Olga

مصطلحات موضوعية: Problème du voyageur de commerce généralisé avec contraintes de précédence, Programmation en nombres entiers, Algorithme Branch-And-Cut, Inégalités valides et facettes, Structure polyédrique, Problème de chemin de coupe, Problème de coupe du point final, ALNS, Problème de tournées de véhicules avec capacité, Schéma d’approximation en temps quasi-polynomial, Precedence Constrained Generalized Traveling Salesman Problem, Integer programming, Branch-And-Cut algorithm, Facet-inducing inequalities, Polyhedral structure, Cutting Path Problem, Endpoint Cutting Problem, Adaptive Large Neighborhood Search, Capacitated Vehicle Routing Problem, Quasi-Polynomial Time Approximation Scheme

Relation: http://www.theses.fr/2023BORD0346/document

الاتاحة: http://www.theses.fr/2023BORD0346/document

المؤلفون: Khachai, Daniil

المساهمون: Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux, Boris Detienne, Olga Battaïa

المصدر: https://theses.hal.science/tel-04372176 ; Data Structures and Algorithms [cs.DS]. Université de Bordeaux, 2023. English. ⟨NNT : 2023BORD0346⟩.

مصطلحات موضوعية: Precedence Constrained Generalized Traveling Salesman Problem, Integer programming, Branch-And-Cut algorithm, Facet-inducing inequalities, Polyhedral structure, Cutting Path Problem, Endpoint Cutting Problem, Adaptive Large Neighborhood Search, Capacitated Vehicle Routing Problem, Quasi-Polynomial Time Approximation Scheme, Problème du voyageur de commerce généralisé avec contraintes de précédence, Programmation en nombres entiers, Algorithme Branch-And-Cut, Inégalités valides et facettes, Structure polyédrique, Problème de chemin de coupe, Problème de coupe du point final, ALNS, Problème de tournées de véhicules avec capacité, Schéma d’approximation en temps quasi-polynomial, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Relation: NNT: 2023BORD0346; tel-04372176; https://theses.hal.science/tel-04372176; https://theses.hal.science/tel-04372176/document; https://theses.hal.science/tel-04372176/file/KHACHAI_DANIIL_2023.pdf

الاتاحة: https://theses.hal.science/tel-04372176
https://theses.hal.science/tel-04372176/document
https://theses.hal.science/tel-04372176/file/KHACHAI_DANIIL_2023.pdf

المؤلفون: Coelho, Karen Rocha, Cherri, Adriana Cristina, Baptista, Edméa Cassia, Chiappetta Jabbour, Charbel José, Soler, Edilaine Martins

المساهمون: Universidade Estadual Paulista (UNESP)

مصطلحات موضوعية: Cutting problem, Mathematical modelling, Sustainable operations, Sustainable supply chain

وصف الملف: 545-552

Relation: Journal of Cleaner Production; 1,467; http://dx.doi.org/10.1016/j.jclepro.2017.08.153; Journal of Cleaner Production, v. 167, p. 545-552.; http://hdl.handle.net/11449/179198; 2-s2.0-85029690821; 2-s2.0-85029690821.pdf; 196503152950828; 8479687404526958; orcid:0000-0002-7615-5768; orcid:0000-0002-5642-8925

الاتاحة: http://hdl.handle.net/11449/179198
https://doi.org/10.1016/j.jclepro.2017.08.153

المؤلفون: Eliane Vendramini de Oliveira, Rubén Romero

المصدر: Pesquisa Operacional, Volume: 42, Article number: e260406, Published: 25 NOV 2022

مصطلحات موضوعية: metaheuristics, two-dimensional cutting problem, Genetic algorithm, Management Science and Operations Research

وصف الملف: text/html

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ec012151248de3b971496529d70e7ea
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100226&lng=en&tlng=en

المؤلفون: ASSIS, N. S., RANGEL, S.

المصدر: Trends in Computational and Applied Mathematics, Volume: 23, Issue: 4, Pages: 683-703, Published: 14 NOV 2022

مصطلحات موضوعية: dynamic programming, Two-dimensional two-stages guillotine cutting problem, problema restrito, heurística, heuristic, Problema de corte bidimensional guilhotinado 2-estágios, constrained problem, programação dinâmica

وصف الملف: text/html

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od_______608::dd44c3c1cca6ceedf66cec3fcf3445f8
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S2676-00292022000400683&lng=en&tlng=en

المؤلفون: Ito, Hiro, Ueda, Takahiro

المساهمون: Hiro Ito and Takahiro Ueda

مصطلحات موضوعية: sublinear-time algorithms, cake-cutting problem, simple fair, preassign, approximation

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.21

الاتاحة: https://doi.org/10.4230/LIPIcs.FUN.2016.21
https://nbn-resolving.org/urn:nbn:de:0030-drops-58639
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.21

المؤلفون: Delorme, Maxence, Martello, Silvano, IORI, MANUEL

المساهمون: Delorme, Maxence, Iori, Manuel, Martello, Silvano

مصطلحات موضوعية: Logic based Benders' decomposition, Orthogonal stock cutting problem, Pallet loading, Rectangle packing, Computer Science (all), Modeling and Simulation, Management Science and Operations Research

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000390071400024; volume:78; firstpage:290; lastpage:298; journal:COMPUTERS & OPERATIONS RESEARCH; http://hdl.handle.net/11380/1110923; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84990234529; http://www.sciencedirect.com/science/article/pii/S0305054816302301

الاتاحة: http://hdl.handle.net/11380/1110923
https://doi.org/10.1016/j.cor.2016.09.009
http://www.sciencedirect.com/science/article/pii/S0305054816302301

المؤلفون: Makarovskikh, T., Savitskiy, E.

المصدر: Procedia Engineering

مصطلحات موضوعية: ALGORITHM, CUTTING PROBLEM, EULERIAN TRAIL, HAMILTONIAN TRAIL, PLANE GRAPH, ROUTING, ALGORITHMS, CUTTING PROBLEMS, CUTTING SHEETS, EULERIAN, PLANE GRAPHS, RESOURCE SAVINGS, RESOURCE-SAVING TECHNOLOGIES, MACHINERY

وصف الملف: application/pdf

Relation: Makarovskikh T. Algorithms for constructing resource-saving cutting machines / T. Makarovskikh, E. Savitskiy // Procedia Engineering. — 2015. — Vol. 129. — P. 781-786.; 67925; http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84960942447; https://doi.org/10.1016/j.proeng.2015.12.104; 7790533d-0d34-45e7-acad-d3195605f520; http://elar.urfu.ru/handle/10995/75643; 84960942447; 000378933900080

الاتاحة: http://elar.urfu.ru/handle/10995/75643
http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84960942447
https://doi.org/10.1016/j.proeng.2015.12.104

المؤلفون: Faezeh Asadian Ardakani, Ali Morovati Sharifabadi

المصدر: Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, Vol 10, Iss 26, Pp 75-94 (2012)

مصطلحات موضوعية: optimization, meta-heuristic algorithms, discrete particle swarm optimization (dpso), cul algorithm, twodimensional cutting problem, Industrial engineering. Management engineering, T55.4-60.8

وصف الملف: electronic resource

Relation: https://jims.atu.ac.ir/article_1939_d758b7e5d1ab533d129fbf8164663603.pdf; https://doaj.org/toc/2251-8029; https://doaj.org/toc/2476-602X

URL الوصول: https://doaj.org/article/4b89e085e25a452f9715198f2f0b377d

المؤلفون: Moretti, Antonio Carlos, Salles Neto, Luiz Leduíno de

المصدر: Computational & Applied Mathematics. January 2008 27(1)

مصطلحات موضوعية: cutting problem, nonlinear programming, column generation

وصف الملف: text/html

URL الوصول: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022008000100004

المؤلفون: Faezeh Asadian Ardakani, Ali Morovati Sharifabadi

المصدر: چشم‌انداز مدیریت صنعتی, Vol 1, Iss 3, Pp 121-137 (2011)

مصطلحات موضوعية: bird flight algorithm, discrete bird flight algorithm, cul algorithm, 2d cutting problem, Management. Industrial management, HD28-70

وصف الملف: electronic resource

Relation: https://jimp.sbu.ac.ir/article_87368_7c27e700093e5225365dd076a71423cd.pdf; https://doaj.org/toc/2251-9874; https://doaj.org/toc/2645-4165

URL الوصول: https://doaj.org/article/8eb20663b0ac4887a65d967655f7741e