arXiv (All)
open access
A matheuristic for solving the single row facility layout problem
The single row facility layout problem (SRFLP) is a well-studied NP-hard combinatorial optimization problem with applications in manufacturing and logistics systems. In the SRFLP, a set of facilities with lengths is given, as well as weights between each pair of facilities. The facilities must be
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
- A Sparse Corner-Difference MILP for Minimum Square Tiling#1035855
- A variable neighborhood search approach for cyclic bandwidth sum problem#243775
- A New Heuristic for Solving the Parking Assignment Problem#1235424
- Combining state-of-the-art row generation methods for the competitive facility location problem with multinomial logit choice rule#1092429
- Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs#1187194
Record · ID 1354789
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