2020
DOI: 10.1016/j.knosys.2020.106352
|View full text |Cite
|
Sign up to set email alerts
|

An efficient metaheuristic for the K-page crossing number minimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…In this section, the solution approaches for the proposed problem along with the encoding and decoding schemes are represented. When it comes to solving large-size problems, it could be difficult to obtain the best solutions by exact approaches as they usually consume both time and cost ( [82] ). Therefore, although the proposed models are validated with an exact solver (GAMS), for the larger size problems, multiple meta-heuristic algorithms and hybridized ones are utilized.…”
Section: Solution Approachmentioning
confidence: 99%
“…In this section, the solution approaches for the proposed problem along with the encoding and decoding schemes are represented. When it comes to solving large-size problems, it could be difficult to obtain the best solutions by exact approaches as they usually consume both time and cost ( [82] ). Therefore, although the proposed models are validated with an exact solver (GAMS), for the larger size problems, multiple meta-heuristic algorithms and hybridized ones are utilized.…”
Section: Solution Approachmentioning
confidence: 99%