HAL (France)
open access
Bargaining solutions for biobjective combinatorial optimization and applications to some graph covering problems
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- THE VERTEX COVER GAME#684896
- Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991
- Improved Multilayered PCPs and Hypergraph Vertex Cover#974864
- Iterated Exact and Heuristic Algorithms for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Constraints#210381
- Global Pollinator Conference - Programme#500299
Record · ID 155963
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive