129 related articles for article (PubMed ID: 33444394)
1. Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology.
Cid-Garcia NM; Rios-Solis YA
PLoS One; 2021; 16(1):e0245267. PubMed ID: 33444394
[TBL] [Abstract][Full Text] [Related]
2. Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem.
Cid-Garcia NM; Rios-Solis YA
PLoS One; 2020; 15(4):e0229358. PubMed ID: 32251428
[TBL] [Abstract][Full Text] [Related]
3. A deep reinforcement learning algorithm for the rectangular strip packing problem.
Fang J; Rao Y; Shi M
PLoS One; 2023; 18(3):e0282598. PubMed ID: 36928505
[TBL] [Abstract][Full Text] [Related]
4. A set-covering based heuristic algorithm for the periodic vehicle routing problem.
Cacchiani V; Hemmelmayr VC; Tricoire F
Discrete Appl Math; 2014 Jan; 163(Pt 1):53-64. PubMed ID: 24748696
[TBL] [Abstract][Full Text] [Related]
5. Impact of minimum distance constraints on sheet metal waste for plasma cutting.
Francescatto M; Luiz Neuenfeldt Júnior A; Silva E; Furtado JC; Bromberger D
PLoS One; 2023; 18(9):e0292032. PubMed ID: 37756358
[TBL] [Abstract][Full Text] [Related]
6. Covering, corner-searching and occupying: A three-stage intelligent algorithm for the 2d multishape part packing problem.
Ren H; Zhong R
PLoS One; 2022; 17(5):e0268514. PubMed ID: 35639732
[TBL] [Abstract][Full Text] [Related]
7. On complexity of optimal recombination for binary representations of solutions.
Eremeev AV
Evol Comput; 2008; 16(1):127-47. PubMed ID: 18386998
[TBL] [Abstract][Full Text] [Related]
8. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
9. Electric fields in an electrolyte solution near a strip of fixed potential.
Khripin C; Jagota A; Hui CY
J Chem Phys; 2005 Oct; 123(13):134705. PubMed ID: 16223324
[TBL] [Abstract][Full Text] [Related]
10. Approximate strip exchanging.
Roy S; Thakur AK
Int J Comput Biol Drug Des; 2008; 1(1):88-101. PubMed ID: 20055003
[TBL] [Abstract][Full Text] [Related]
11. Coordination of cluster ensembles via exact methods.
Christou IT
IEEE Trans Pattern Anal Mach Intell; 2011 Feb; 33(2):279-93. PubMed ID: 20421664
[TBL] [Abstract][Full Text] [Related]
12. A polynomial time solvable formulation of multiple sequence alignment.
Sze SH; Lu Y; Yang Q
J Comput Biol; 2006 Mar; 13(2):309-19. PubMed ID: 16597242
[TBL] [Abstract][Full Text] [Related]
13. Approximating covering problems by randomized search heuristics using multi-objective models.
Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
Evol Comput; 2010; 18(4):617-33. PubMed ID: 20583912
[TBL] [Abstract][Full Text] [Related]
14. Fast variation method for elastic strip calculation.
Biryukov SV
IEEE Trans Ultrason Ferroelectr Freq Control; 2002 May; 49(5):635-42. PubMed ID: 12046939
[TBL] [Abstract][Full Text] [Related]
15. Cost-minimizing team hires with participation constraint.
Sun H; Huang J; Liu K; Wan M; Zhou Y; Cao C; Jia X; He L
PLoS One; 2018; 13(8):e0201596. PubMed ID: 30153254
[TBL] [Abstract][Full Text] [Related]
16. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
Lim WL; Wibowo A; Desa MI; Haron H
Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
[TBL] [Abstract][Full Text] [Related]
17. Optimal shortening of uniform covering arrays.
Torres-Jimenez J; Rangel-Valdez N; Avila-George H; Carrizalez-Turrubiates O
PLoS One; 2017; 12(12):e0189283. PubMed ID: 29267343
[TBL] [Abstract][Full Text] [Related]
18. An efficient constructive heuristic for the rectangular packing problem with rotations.
Zhao X; Rao Y; Qi P; Lyu Q; Yang P; Yu S
PLoS One; 2023; 18(12):e0295206. PubMed ID: 38153931
[TBL] [Abstract][Full Text] [Related]
19. Automating the packing heuristic design process with genetic programming.
Burke EK; Hyde MR; Kendall G; Woodward J
Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
[TBL] [Abstract][Full Text] [Related]
20. Robust min-max regret covering problems.
Coco AA; Santos AC; Noronha TF
Comput Optim Appl; 2022; 83(1):111-141. PubMed ID: 35855459
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
