Home › Entities › academia › A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems

A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems

Research article (Soft Computing, 2019) · cited 12× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
September 21, 2019as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Soft Computingas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problemsas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2974463220as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1007/S00500-019-04337-0as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 3
Abir Chaabani, Lamjed Ben Said, Slim Bechikh
← Author of 3
Abir Chaabani, Lamjed Ben Said, Slim Bechikh
Press Enter · cited answer in seconds

Summary

A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems is a scholarly article[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems. Retrieved October 18, 2026, from https://4ort.xyz/entity/a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems
MLA “A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems.
BibTeX @misc{4ortxyz_a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems}}, year = {2026}, url = {https://4ort.xyz/entity/a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems}, note = {Accessed: 2026-10-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems — https://4ort.xyz/entity/a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems (retrieved 2026-10-18)

Canonical URL: https://4ort.xyz/entity/a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems · Last refreshed: