{"as_of":"2026-08-06T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c2538988a0eca0fc24fa0219b54eea7b467c929ff7ebf39ba1226a5691d8372","coverage":[{"denominator":90,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":90,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T08:42:06.224999Z","state":"measured"},{"denominator":90,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":90,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.00611/citation-record","integrity":"/paper/2607.00611/integrity","json":"/paper/2607.00611/citation-record.json","paper":"/paper/2607.00611"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.177175Z","title":"and Kennings, Andrew and Vannelli, Anthony , opturldate =","venue":null,"work_id":"052f0182-4f8b-4f82-a069-3bc67e4a2ab9","year":2005},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:130db815e925ed5b4264ea671c30d8a3aa83f9fb1ff345bb364ebae7b6cbcbc2","observation_id":"1525122d-f473-4d5b-af96-7816b0fc8658","resolution":{"observed_at":"2026-07-06T04:31:57.179630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.194541Z","title":"Mathematical Programming , year=","venue":null,"work_id":"948e7bde-bb93-4993-befc-6128a78f30b8","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:dad128b823b237326c84517ae2bc83d8845c553d47185957bcc59936c6fa0ca3","observation_id":"3aa4a8c5-d71c-4ed6-a3f2-c6872fc44ed3","resolution":{"observed_at":"2026-07-06T04:31:57.195839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.142868Z","title":"A computational study and survey of methods for the single-row facility layout problem , volume =","venue":null,"work_id":"82f0d7ff-6538-4920-b68f-549d0a190aee","year":2013},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d597c00978b57ca111f1a3d9f9ff9e210d928fe50e69a46a3eaf49f7f01dd394","observation_id":"9bd66578-e441-401a-9a5b-2850da6f2446","resolution":{"observed_at":"2026-07-06T04:31:57.144503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.031649Z","title":"and Vannelli, Anthony , opturldate =","venue":null,"work_id":"8bb3ac11-154c-47e4-861c-d95ff7939988","year":2008},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d09bab0c156d23833e84cc0c8c068a6b6fb00a5fe098002dc1f75a389e7112ec","observation_id":"043f53dc-4fbf-481b-b1f4-f81e0ff46852","resolution":{"observed_at":"2026-07-06T04:31:57.033249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.040289Z","title":"and Yen, Ginger , opturldate =","venue":null,"work_id":"f0f80a07-cba2-4b04-ae92-276813736bff","year":2009},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:4ae855ffeb7e334c1de0f840bd2e97c0e1b93f80bd94276f3ead199f423a0712","observation_id":"ee4b3ac6-6d28-495c-ac83-9ca1ed3b6aeb","resolution":{"observed_at":"2026-07-06T04:31:57.041754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.092864Z","title":"Semidefinite relaxations of ordering problems , volume =","venue":null,"work_id":"8e087b6b-e74d-458d-bea0-dcb68e2928bc","year":2013},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:32c3e42d804711d5d6b541a11880b996c33c42a28ef7c340d876289f9bdd2c8b","observation_id":"8832c82f-73e6-4365-bebf-031490353cff","resolution":{"observed_at":"2026-07-06T04:31:57.096749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.155766Z","title":"Multi-objective branch and bound , volume =","venue":null,"work_id":"0321c847-5749-419f-ae36-e28816817fad","year":2017},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:5fa2e8dfcb6d54d0d3e8f156a2a7d4bc1e2a0b5cc3eecbd9e5611c321b34aaae","observation_id":"d0f80cbf-2f39-4c8e-8977-f78db40b3211","resolution":{"observed_at":"2026-07-06T04:31:57.157220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.172854Z","title":null,"venue":null,"work_id":"900e2751-2245-4788-8579-1ff78e4c65ab","year":2009},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:77b8572a7261b39d83043aa9d08c934cb025e5c6675db614868d07b83e0151b2","observation_id":"c668ccd1-c9eb-4e93-a1a8-cd175e6a445d","resolution":{"observed_at":"2026-07-06T04:31:57.174290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.164584Z","title":"Cones of matrices and set-functions and 0--1 optimization , volume =","venue":null,"work_id":"13f0ce31-7227-4553-ba1a-eb7873edf941","year":1991},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:edb80a1318e91d039da3de45d60c97df1f00915d05419fa3d2e9b782ddaf3b2c","observation_id":"5e325765-3d08-4199-ba9d-40d1c3af36ea","resolution":{"observed_at":"2026-07-06T04:31:57.166917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.167581Z","title":"Integer Programming , year =","venue":null,"work_id":"70ebcaf5-df28-4030-993c-4cc1849c2620","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:4c015f565d6e483323510d38ff6c3676f42c382ef3d2dbf0f2a709c0c6c5d6d8","observation_id":"f6f1a02c-fd1a-4a43-9ad1-ac93ca5be22d","resolution":{"observed_at":"2026-07-06T04:31:57.169740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.170383Z","title":null,"venue":null,"work_id":"3fe00ff6-6cd4-4557-8e5c-a2c830739745","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:8011b4e6ba767c50fad1867dbb22b0b40cb23c78abfe852a4f254741dc7db9cc","observation_id":"d1c12703-d526-448a-a233-49d6beb40672","resolution":{"observed_at":"2026-07-06T04:31:57.172206Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.180496Z","title":"Mathematical Programming Computation , year =","venue":null,"work_id":"49709f24-4710-4572-8b12-071a84e0508b","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:b1c2ee89b96e86019848345ef9a52c72e7923192204773bdfd9f1f582441f6ac","observation_id":"f624096d-8f90-4d93-a8dc-d892449103fa","resolution":{"observed_at":"2026-07-06T04:31:57.181990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.161635Z","title":"2005 , publisher =","venue":null,"work_id":"9eaf8aff-5e5e-41a8-a1a5-774a2dd1b908","year":2005},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:08d2d69aaf4a0f8a435f9763817625d64f33019b9605a27ed21cda1fd10d5737","observation_id":"58f7d69b-f86c-4751-8b8c-d468ad7c43f8","resolution":{"observed_at":"2026-07-06T04:31:57.162751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.196605Z","title":"IEEE Transactions on Systems, Man, and Cybernetics , year =","venue":null,"work_id":"8f94ab00-4d42-4d7b-aa61-110b3f5306b4","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:8ef17416b05fedab4e3a193344e0effd90d4fcad439dceb7fd444c201e37d2e3","observation_id":"dce9bbbf-5a72-4d54-99b2-8cc79a836e4c","resolution":{"observed_at":"2026-07-06T04:31:57.197908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.132365Z","title":"A hybrid approach for biobjective optimization , volume =","venue":null,"work_id":"3f17c50c-6846-4550-8b99-688ead5d2ab1","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:3c8886a46f80a3e9a94ebedbf8102bff20889dd3e8cbad288793f1846ced23dd","observation_id":"cc8667b0-de35-4daf-812b-1ceb934d3c8b","resolution":{"observed_at":"2026-07-06T04:31:57.133760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.140687Z","title":"Multi-objective integer programming: A general approach for generating all non-dominated solutions , volume =","venue":null,"work_id":"46f5fcd0-f8d4-4f02-b59e-6f09f2c676f8","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:e60a88cbcad5c5589a8ef8e3823dee9fe872040799b03b705c3d9573539c479a","observation_id":"56b37e34-9d4b-4255-983b-76de934ba4ff","resolution":{"observed_at":"2026-07-06T04:31:57.142633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.143252Z","title":"Foundations of Computing and Decision Sciences , author =","venue":null,"work_id":"86c25bdc-1edd-4572-aa19-39fadaa764d0","year":1995},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:52538b1f2fa82fdf585701d9c4bb8ced000d7277a51aa8dfd1c96566b00303e7","observation_id":"071a8797-2313-44e6-b298-bb453f586b35","resolution":{"observed_at":"2026-07-06T04:31:57.144672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.126186Z","title":"A branch and bound algorithm for mixed zero-one multiple objective linear programming , volume =","venue":null,"work_id":"75c0c69f-af1b-41c7-94d1-6500af699323","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:a66ce233afa209c0990a027dc68b48fa1285f3e96298abcf9083c1545909df5d","observation_id":"9da02fe4-fe7c-4e13-bff9-23f3a6040746","resolution":{"observed_at":"2026-07-06T04:31:57.127732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.123718Z","title":"Multi-criteria branch and bound: A vector maximization algorithm for mixed 0-1 multiple objective linear programming , volume =","venue":null,"work_id":"fbe686cc-e6e1-421f-b8f4-5b565da4b3e9","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:f42b9edd0ae29015b0cbb2949170ac8fcb9a2365776aa133d1febf88181faa12","observation_id":"873bb727-3d3b-427d-a3ee-6980725d4c32","resolution":{"observed_at":"2026-07-06T04:31:57.125577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.128528Z","title":"Management Science , volume =","venue":null,"work_id":"32ff1bbd-4a20-43b1-8d83-d8e23238ea16","year":2014},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:71ae8511193b3ac4809cdd20a0788e3cd984a004f3d66df794b2ac5558ce3724","observation_id":"24a8254e-0af3-44ba-ae69-bbe40256fc65","resolution":{"observed_at":"2026-07-06T04:31:57.129713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.110989Z","title":", year =","venue":null,"work_id":"57a1e293-28b1-49d4-8e18-520478d9964b","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:31fda88f73716bcd81207b63bd55df86d9b9ba8f74bf640c42c3fc7a5b76acb9","observation_id":"32082ae9-6ada-4290-ad91-291f560ff3ba","resolution":{"observed_at":"2026-07-06T04:31:57.114018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.108711Z","title":"An algorithm for the multiple objective integer linear programming problem , volume =","venue":null,"work_id":"3733f6a1-366d-44ce-bbb2-721a86728da5","year":1982},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:da0b451ebb4a415f66d89070acefea189abdffe7d0c0dfc620c765fd7b55ea29","observation_id":"24725b54-4ac0-4f2e-9f43-47628a3d8905","resolution":{"observed_at":"2026-07-06T04:31:57.110401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.121643Z","title":"INFORMS Journal on Computing , shortjournal =","venue":null,"work_id":"e724be26-c51f-48a6-ab8c-767f613d0aa6","year":2022},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:b39075477133e28ad25420f72a02cd2f900b00712ca721e1d3522497137bc8b2","observation_id":"04888021-5c4c-45b3-8df4-a799fe74fffe","resolution":{"observed_at":"2026-07-06T04:31:57.123084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.130300Z","title":"European Journal of Operational Research , shortjournal =","venue":null,"work_id":"dd4d5089-7bda-4cf1-a989-5954efee9811","year":1998},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:49f56ea03068743edc2bb9b46150da7fdb714c27699a1a813724860963f91183","observation_id":"ea1fa87c-8132-4754-bec6-2ebbc08a3593","resolution":{"observed_at":"2026-07-06T04:31:57.131563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.149313Z","title":"Journal of Global Optimization , shortjournal =","venue":null,"work_id":"b678be1c-27ab-441f-b322-e0d0119a6812","year":1998},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:73bbfe60b99419d6655a9ecf1f3d91e423061691793495446a755d58caa11aff","observation_id":"df655998-377b-4120-914d-b432497066b2","resolution":{"observed_at":"2026-07-06T04:31:57.150716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.159515Z","title":"INFORMS Journal on Computing , shortjournal =","venue":null,"work_id":"20f81ffc-d145-45aa-bc63-cdb36350d534","year":2008},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:9038843eabeb9af4283d1978f8865cc7679636c0fbc8d7483c23124fe911ba56","observation_id":"82e839c6-b723-4401-9dee-d3ab566ce69b","resolution":{"observed_at":"2026-07-06T04:31:57.161027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.098781Z","title":"2013 , opturl =","venue":null,"work_id":"e25a7dac-f04e-490f-b756-d01616dd4501","year":2013},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:02fd24e4bdf1e42ad6f5eddf5323cc246fb67a77b7ab20ac436dd1497b1f5bc8","observation_id":"ebf4efbc-737f-4251-bf80-1dd6d3b9f727","resolution":{"observed_at":"2026-07-06T04:31:57.100932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.082512Z","title":"and Nielsen, Lars R","venue":null,"work_id":"0fb141b6-4fcf-485d-85a1-cf5ee699f1af","year":2019},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:7667826086dbc24869f73cd2d48c9532a461959d694603269e8d3b5a49b8bf1b","observation_id":"56487204-d6d2-4e02-9bfe-73107b12fd0b","resolution":{"observed_at":"2026-07-06T04:31:57.083945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.084687Z","title":"INFORMS Journal on Computing , shortjournal =","venue":null,"work_id":"53a16fe7-b9e5-425d-a11f-972e0baf0344","year":2019},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:f9b4b77220e95f158f4d9e6a3dd7d73464e143fd88443982d86f1002d7575cbd","observation_id":"c7b35b57-07dd-4683-afe2-19d3dc510481","resolution":{"observed_at":"2026-07-06T04:31:57.086537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.087165Z","title":"and Nielsen, Lars R","venue":null,"work_id":"a54ab9c2-6be1-4a9f-9ae0-62ac2258aa1e","year":2022},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:856c88c87f3a85035bf325ac87187fab475009bea94b465b344cbb537fd80e1d","observation_id":"eb927515-7ea7-4db2-98dd-739d8e0716bb","resolution":{"observed_at":"2026-07-06T04:31:57.088907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.089691Z","title":", title =","venue":null,"work_id":"08cf5402-f30f-4b3a-b030-de6d3391249b","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:5259764693c3f0248c59e1df16e93aafea7a1ec29f8e0fa68dbfa078a247ff06","observation_id":"c3f1ad7d-b730-4f20-b0ad-6db452de5f7f","resolution":{"observed_at":"2026-07-06T04:31:57.091860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.069481Z","title":"and Löhne, Andreas and Rudloff, Birgit , title =","venue":null,"work_id":"9a73eca1-12d8-40ff-802e-fd60f36d405d","year":2013},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:bb569c3b4ceee1ada0cbf2f550aedcac8a53a0bc48e3e457d90cbdc79ed7bf01","observation_id":"67323174-8d1c-49c7-a7bc-cfaefde707ea","resolution":{"observed_at":"2026-07-06T04:31:57.071567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.072322Z","title":"European Journal of Operational Research , shortjournal =","venue":null,"work_id":"cc1dc579-a537-42b6-800e-8d85324b1368","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:af769083b84bf110943b2b7bb72ae81cb15c7e99c7506b825921b6d7f11b2b31","observation_id":"98e4586f-a97c-411d-b0a5-acf3117706da","resolution":{"observed_at":"2026-07-06T04:31:57.073967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.079945Z","title":"An additive algorithm for solving linear programs with zero-one variables , opturldate =","venue":null,"work_id":"5e99afcd-fb0f-42f2-9d35-71ff5e4cab7b","year":1965},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:69b2e53a57a2ec713542387518e0eb15312bbff6ab479b1d180ede8b53724cab","observation_id":"b0c5d428-9999-4e9e-8211-96ab5a1846c6","resolution":{"observed_at":"2026-07-06T04:31:57.081650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.064595Z","title":"Sensitivity analysis for branch and bound integer programming , opturldate =","venue":null,"work_id":"63bee8a9-dd39-4fd3-b29f-0c4b93f57b45","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:4e3a72b31be1cfffeb796bacaf37ca00fac8c2aead6129a721d46920fddfd912","observation_id":"4add9b82-ef54-4bb1-8606-8f07320738b8","resolution":{"observed_at":"2026-07-06T04:31:57.066165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.059144Z","title":", title =","venue":null,"work_id":"5cdc0859-3119-4955-95f2-4e293d4166f7","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:0e0ce599603148925318c825412dfe84daaa5827c60dec9067a7e3aa2f7b2aa8","observation_id":"6b54062d-9774-461c-922c-d7b4bf33712b","resolution":{"observed_at":"2026-07-06T04:31:57.060432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.061497Z","title":", title =","venue":null,"work_id":"267f2849-70c8-49c4-ad87-066bd56553f6","year":1969},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:61d44b6379c9431f41b0f6bd0df11ef7e13940a83e5c4c304442fd315b7bc4a4","observation_id":"8bce8c8f-3581-4a32-872b-da7f4132e7db","resolution":{"observed_at":"2026-07-06T04:31:57.063863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.114823Z","title":"INFOR: Information Systems and Operational Research , shortjournal =","venue":null,"work_id":"3d980ca7-eaca-440b-9d9c-dba1276852bb","year":1976},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:86d99d2380f989ddc37e49ffa1d6d19e6871d04569e78002aae658e17716f618","observation_id":"3357a9df-2979-47e1-b585-c20d08c42ce3","resolution":{"observed_at":"2026-07-06T04:31:57.116359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.055130Z","title":"and Kusiak, Andrew , year =","venue":null,"work_id":"376cb788-7af6-4ff6-b32f-8cc4ec06f8ca","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:427204e00a6f868d61c08a472ce2b409b7a699733d745fed74caaed1eb43a40a","observation_id":"25123e20-74c3-4775-9f76-bb930a22a210","resolution":{"observed_at":"2026-07-06T04:31:57.056637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.117260Z","title":null,"venue":null,"work_id":"dada9f8f-df4e-41a7-9a54-4051369eb3e2","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:7caa8cde3183956d5e53c5fca3516622f582f1f891f552a4a18f2f234a431487","observation_id":"7e3f3204-9d6b-43cb-80c8-9288719c59d2","resolution":{"observed_at":"2026-07-06T04:31:57.118754Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.119465Z","title":"Optimality and non-scalar-valued performance criteria , year =","venue":null,"work_id":"5c7cae4d-820b-46e0-91f2-f8e512fc2562","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:141c227fa18b5ce7582a19caec591df6d486239c7bf6a228cd9823db2f643cc8","observation_id":"11e18409-1ae0-44d0-b75c-5e8f74157b31","resolution":{"observed_at":"2026-07-06T04:31:57.121015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.053017Z","title":"Management Science , shortjournal =","venue":null,"work_id":"124d88e3-7169-429b-a014-99188530025c","year":2010},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:3fe2ba6d0ef2260c740d8746c47544337d75c094d643fc552c662d062d757b82","observation_id":"d509cbd9-739c-4856-ad77-fbbbfce44aaa","resolution":{"observed_at":"2026-07-06T04:31:57.054342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.057240Z","title":"INFORMS Journal on Computing , shortjournal =","venue":null,"work_id":"a4e0f1cb-7b5a-4caa-9ca1-235aaef728e1","year":2010},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:0379f03c98a3129c63b91593dc971abeffa4bbdbb86cc52162e7bcf7230bf6c2","observation_id":"d3b27c23-920f-48a6-88d2-c88fe13a87f4","resolution":{"observed_at":"2026-07-06T04:31:57.058586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.093754Z","title":"Computational Optimization and Applications , shortjournal =","venue":null,"work_id":"27236873-8d5d-4334-9bb7-e36f21b27f36","year":2007},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:aa58a26b4355225630be3ce0548b413b92f0c0ba45054c49b2fb5278a7163fe3","observation_id":"55ea0458-2f98-49db-80a9-e4ad7b5a85d4","resolution":{"observed_at":"2026-07-06T04:31:57.095565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.074588Z","title":"and Vannelli, Anthony , title =","venue":null,"work_id":"2ecc040e-5650-478b-ac14-b2ffc80b65c2","year":2005},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:2e7729d4af2274e62a39b2fb5f818e5f4f6b96679125ec0e9935d5d2e09567e6","observation_id":"27c1c848-aa07-4cac-8e56-fd7af8e1aa9a","resolution":{"observed_at":"2026-07-06T04:31:57.076338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.051104Z","title":"and Sinnl, Markus and Tricoire, Fabien , journal =","venue":null,"work_id":"fb66bb6d-4956-424f-ac62-276e366a9a36","year":2024},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:a73cf3960c9efa5aa0772c9cfeba173ab25803d934c5cbdb59588c32474eddda","observation_id":"2cbb5252-8167-4dd5-975d-6d72a5f0a565","resolution":{"observed_at":"2026-07-06T04:31:57.052473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.044359Z","title":"ACM Transactions on Mathematical Software , shortjournal =","venue":null,"work_id":"8e4a0ed6-c445-48ce-aa6c-ec6d5b96559b","year":2017},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:b4146780b6f0ed1e5465e9487364c0eed7f7d5e2c6b7043f0c73619c228fc5a4","observation_id":"c7d8d417-4557-4cd7-a432-d061d25d8d20","resolution":{"observed_at":"2026-07-06T04:31:57.046034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.077342Z","title":"OR Spektrum , shortjournal =","venue":null,"work_id":"c0074325-8aec-4d1f-8c98-3272609db2e3","year":1994},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:156b43d44bafc81420f5ce414e327f331659c96d2e8bcbe0c51f9e81c74a789d","observation_id":"37c58bc9-4b5d-4161-99c0-9a5e14ccf8ab","resolution":{"observed_at":"2026-07-06T04:31:57.079130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.131934Z","title":"1984 , publisher =","venue":null,"work_id":"9ac1f9c9-f95b-458d-a427-3856d6ad97bd","year":1984},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d4d0dec54d1c763b2bd34c065752164a1a035e862431ad41ee756f39585ceca7","observation_id":"d5e7fe50-7af6-446b-9834-6acb85fb4660","resolution":{"observed_at":"2026-07-06T04:31:57.133514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.186841Z","title":null,"venue":null,"work_id":"37ebea7b-0cbe-4db6-98ac-33d91aca1101","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:2436054699b9c0c2f6fa87c8436dc8218ff8d056269757a657412d195b361cc1","observation_id":"225488f2-b38d-40c3-8080-b17bec392559","resolution":{"observed_at":"2026-07-06T04:31:57.188526Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.175088Z","title":", title =","venue":null,"work_id":"8741fe39-a01a-4e7e-b971-e4298d5310e5","year":2012},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:13307386aa72874fe6b2384a62931034afd3692584c5d2c0ed37fac3ad210a36","observation_id":"1fc924cb-369b-40e6-84d1-66a550806b52","resolution":{"observed_at":"2026-07-06T04:31:57.176553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.157873Z","title":null,"venue":null,"work_id":"e35f8895-1cd3-410d-a74f-1ec412858ebf","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:28effceecab040c8d9ff3f33d70d9ad2e856775fa8f3d96be15179cb66c26f38","observation_id":"bf3b1564-0763-4ed4-9983-ca6e3f717459","resolution":{"observed_at":"2026-07-06T04:31:57.158992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.100749Z","title":"Mathematical Programming Computation , shortjournal =","venue":null,"work_id":"b963800d-7f86-4a5c-a8f6-bb50161de2f4","year":2025},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:320b1cc2d89b91b8b1505d9de28a8322dcdccfada433101b4f7080362290c4f5","observation_id":"d70beab2-c2c8-4373-8ce7-344f7c97fd4d","resolution":{"observed_at":"2026-07-06T04:31:57.102154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.137453Z","title":"Mathematical Programming , shortjournal =","venue":null,"work_id":"6562a8f2-7e26-4ad2-98d1-37061daa1360","year":2010},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:71eadb100222f16728759ae8c381190acfa10dad05dc3460699c260af146fa33","observation_id":"92400482-74a2-4123-8dd8-01912532065f","resolution":{"observed_at":"2026-07-06T04:31:57.139515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.105702Z","title":"and Johnson, David S","venue":null,"work_id":"86003ec2-09a3-4022-a983-42a2ff003545","year":1976},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:837f60ea24e5de8df18d582651352e902e91027bd98eaa902466d08cec3ad9f6","observation_id":"d009fea8-c69d-476f-9df7-1138ca2346c5","resolution":{"observed_at":"2026-07-06T04:31:57.106931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.033933Z","title":"and Queyranne, Maurice , title =","venue":null,"work_id":"7966c19f-2f8d-448d-bfe8-cf94f37c0359","year":1981},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:896a1b90d18bb8a695ae2b0f5367c6f5240ae97c61582c006ee3b3e558a4b201","observation_id":"c0d932e2-0642-4fff-bc6c-646a2ebe2626","resolution":{"observed_at":"2026-07-06T04:31:57.035362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.147229Z","title":"and Negahban, Ashkan , year =","venue":null,"work_id":"3c6087a0-e1bb-45b9-9d65-27eaedf8f51f","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:b4262c4ff2f5bd427acedf94e2409e2819e5ecf7f697f59e392c7d652dbab7a8","observation_id":"423c62e9-9cff-42b2-a0fa-63b071f24c3c","resolution":{"observed_at":"2026-07-06T04:31:57.148689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.145386Z","title":"Electrotehnica, Electronica, Automatica , shortjournal =","venue":null,"work_id":"2d65d9b3-79c4-4ee1-9762-d247fed72135","year":2025},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:0691bb9dfac3fd98abf04f376a0bd3872800c64b4e6bd4f8784540d1edf77687","observation_id":"81b65106-cd1f-4c6e-914f-21a8e32720fb","resolution":{"observed_at":"2026-07-06T04:31:57.146516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.035925Z","title":"and Gurusamy, Selvakumar and Dharmaraj, Vignesh K","venue":null,"work_id":"235c9ead-eaa3-4e83-9e0b-c2a98e36f620","year":2018},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:2b6609c17ade96c39cc29e4bbed25254da6dbbd41aa0ad16cac766cd15ab06c4","observation_id":"5a667fc9-f8d9-4d0c-ac65-d5fcce2b83aa","resolution":{"observed_at":"2026-07-06T04:31:57.037625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.026754Z","title":"and Ravindran, Siva K","venue":null,"work_id":"34976461-5059-4a6b-8f2e-faee22d16ea6","year":2014},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:59fc92207cda3f161393f6385af781509c921137d16a04859400414743cebc49","observation_id":"8f270169-c044-419c-b256-1c961e318c8d","resolution":{"observed_at":"2026-07-06T04:31:57.028583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.118497Z","title":"The International Journal of Advanced Manufacturing Technology , shortjournal =","venue":null,"work_id":"2e516fdf-51e6-4909-b50f-75e12b339295","year":2012},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:17ef558a5b082758764f26be33e8cd147161364ba2705e86e9733d31c99cfabb","observation_id":"9be56094-ff43-4052-9f18-067bbce291f2","resolution":{"observed_at":"2026-07-06T04:31:57.119982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.120713Z","title":"INFORMS Journal on Computing , shortjournal =","venue":null,"work_id":"b440ceba-997b-4eaa-b2b8-d332a083d2d6","year":2010},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:6b75f36a599630d7acf68db3f552415c8a0d5826b09c91487a7b3fc6448e350b","observation_id":"24c47d50-eee5-4b92-bfd7-31b4ab34b732","resolution":{"observed_at":"2026-07-06T04:31:57.121960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.122676Z","title":"An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , volume =","venue":null,"work_id":"7024f63f-4c32-40fb-bfe7-64b4cf5e86ca","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:dc06506b02b4eaecce59809f8f42556fa040d5e9ad8f865ee2290fedca16ea51","observation_id":"0b5b4e71-e6fb-4a52-9b36-08f42fb0ffa9","resolution":{"observed_at":"2026-07-06T04:31:57.124566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.042351Z","title":"2020 , note =","venue":null,"work_id":"d1a97545-e0cc-408f-83e1-9502bdf4b6ce","year":2020},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:02a3ad522c9334aa65e6bd8a7011e62c82a4ac453263d1772cf5ed71cd3748a4","observation_id":"9cb3fba4-18e8-4ffd-8438-3142d08f61a7","resolution":{"observed_at":"2026-07-06T04:31:57.043718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.151787Z","title":"Operations Research Proceedings 2021 , year =","venue":null,"work_id":"9a7aca3f-653e-46a2-ab6c-2f5fe33f6288","year":2021},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d836ba3b362c6cc386cc3b2be029f591b986e73aeffa44c4dec33fc60984f4a8","observation_id":"30ad27a0-346a-4538-b95e-ac7ee7a86c71","resolution":{"observed_at":"2026-07-06T04:31:57.153008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.189057Z","title":"and Dächert, Kerstin and Klamroth, Kathrin and Ruzika, Stefan , title =","venue":null,"work_id":"ade653f4-2ea6-4ec2-8e49-dbcbd420cb45","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:cb7315e7cee01a6e853ef7891ee333dc582589afbcd9ae69a6ea71583488bd4f","observation_id":"1cedcd4f-ce68-4675-a256-2631156f8fea","resolution":{"observed_at":"2026-07-06T04:31:57.190866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.007987Z","title":"and Alfa, Attahiru S","venue":null,"work_id":"793de3e5-c2c3-4b89-9b8b-9ae0931b83c1","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:cead95a2330a89204946a65148a5c6263baf600b41e88a955b62c0de801d0f2d","observation_id":"8f901dbb-3366-429b-b20b-0b96e25e9668","resolution":{"observed_at":"2026-07-06T04:31:57.009236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.182550Z","title":"Fast local search for single row facility layout , volume =","venue":null,"work_id":"6ce93dc8-2ee0-43ad-aac3-d0f90659e446","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:05c9bd8893946c8690060167e7fba1aa332fc718e5bfe0a03b6ecded5c85fbd4","observation_id":"89f0bc24-b1ba-4c75-bdfe-83451a5c0886","resolution":{"observed_at":"2026-07-06T04:31:57.184176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.127592Z","title":"Knowledge-Based Systems , shortjournal =","venue":null,"work_id":"fe00d2c2-78a8-4881-83ba-b77b1c333032","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d625b2b4c391ca40e18d261922f09723b745eb39ab6a3b364ff5b8580b96178e","observation_id":"13cc9ea1-d470-411d-95bc-7aaf5b1012e6","resolution":{"observed_at":"2026-07-06T04:31:57.129376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.125439Z","title":"Single row facility layout using multi-start simulated annealing , volume =","venue":null,"work_id":"2a6be9d9-984a-4b13-a96a-e438fc86b5b6","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d10e8c50171718011bca9a11c609ef23c1e38f60c07b4459c32c749cd8b375d7","observation_id":"2c94705a-f645-427a-a7c6-faa21b2c12fa","resolution":{"observed_at":"2026-07-06T04:31:57.126971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.018967Z","title":null,"venue":null,"work_id":"591cfd3e-e90f-4be3-b9c1-d86f0c211d4c","year":2008},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:6c3c5e255ca669e30b657b7fd829c5c4bad72059abf931381b3862090a966cf7","observation_id":"021a43db-02b5-4134-b811-bae69ddaf23d","resolution":{"observed_at":"2026-07-06T04:31:57.020627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.013280Z","title":"and Kusiak, Andrew , journal =","venue":null,"work_id":"25ed08c7-c40e-473b-b825-160f1fdd2489","year":1988},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:8dba8c6d4b411948ec48e2d7a09c8f925fc0ae0d7d36b96e7d86f055ce366a77","observation_id":"7291849b-74f3-4b3f-bc31-ca914852ee7f","resolution":{"observed_at":"2026-07-06T04:31:57.015454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.021377Z","title":null,"venue":null,"work_id":"029ea90b-232c-4669-9d70-4cd24c20a496","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:71fc4be8d6b5724835ea87cd981c1d4c64dbad9a83677117638ded67eca19b2e","observation_id":"05058278-30cb-44c0-9be9-339c219f6587","resolution":{"observed_at":"2026-07-06T04:31:57.022861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.191449Z","title":", pages =","venue":null,"work_id":"6dfbc68a-3d44-4ed0-ab68-8de70085737e","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:5dc9c0cce3287a8dda8560ad4cb3820911b724ff26782d2798720ce9dbe9a5bf","observation_id":"b74ee18a-70f6-46ac-90bf-f9e1d565a03a","resolution":{"observed_at":"2026-07-06T04:31:57.193220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.004476Z","title":"A bicriteria approach to the two-machine flow shop scheduling problem , journal =","venue":null,"work_id":"e009f7a0-6bfd-4a67-9bf8-75c3206a3585","year":1999},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:b0f3209a32bcd58a5db9c2138339e6953d678e49395b90781033ea48f270f73c","observation_id":"c4a1081f-19cc-4d4c-9f80-ca1b4caca4bf","resolution":{"observed_at":"2026-07-06T04:31:57.005831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.153534Z","title":"ACM Transactions on Mathematical Software , xmonth = jul, articleno =","venue":null,"work_id":"a898b1e6-be4b-422c-903e-05017e0a0705","year":2022},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:4b7e1d71ae020b12931f3f4f2a2a9113f0502c9a99d29206be59ac32d5b529da","observation_id":"438995d0-731c-44e3-8cc0-298f932d2ebe","resolution":{"observed_at":"2026-07-06T04:31:57.155576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.156244Z","title":"Mathematical Programming , year=","venue":null,"work_id":"9284f19a-a128-455c-9304-4464a5d93deb","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:94fd7440276ffe469dcb14aefa6943788fcdfe65bc8b7c672e3f75d27b59ec02","observation_id":"ea1fa488-58ff-470d-b210-78582e2507f3","resolution":{"observed_at":"2026-07-06T04:31:57.159385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.002603Z","title":", title=","venue":null,"work_id":"707cdb3e-6012-4dd7-851e-4433c1257943","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:632338d0da4dc0d4ecf02ac2de3e04c7224a128a0f4444d6ad01472b1281011f","observation_id":"97d7c97c-9f80-4c5e-80e3-eab47815f137","resolution":{"observed_at":"2026-07-06T04:31:57.003849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.160141Z","title":"Mathematical Programming , year=","venue":null,"work_id":"06819a72-9a1c-410f-b339-c7340ef0e26c","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:63055453a7d01dfa4f96aa75f1c05ae36062999ecddba079f8648af2de3de921","observation_id":"ab311fe9-686f-4995-9110-ec521d4dd57e","resolution":{"observed_at":"2026-07-06T04:31:57.161905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.162489Z","title":", title=","venue":null,"work_id":"cdf5166b-5ca0-4db9-acbb-ebafec7f577c","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:3e02126afade54d8d627b40033b6b3500b7c971eff51be923b846b736be07ad4","observation_id":"cdd5aeb0-a265-4114-8055-7c6dcce467fc","resolution":{"observed_at":"2026-07-06T04:31:57.163650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.992146Z","title":"and Williamson, David P","venue":null,"work_id":"8ebb1e7a-e8b6-41ec-a754-24cb21c9d66f","year":1995},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:c14dfb7ca0afbd8e94f8c8ea7529d516c63441a2ef02d888109a8c3379faf085","observation_id":"67c322b6-e947-4c25-97f5-61264c48c74c","resolution":{"observed_at":"2026-07-06T04:31:56.993302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.994027Z","title":"An efficient memetic algorithm for the corridor allocation problem , journal =","venue":null,"work_id":"75846f76-0201-4363-b220-3256e211bb57","year":2026},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:0c9c1fa62829cb15aef43d91adad1a02f044e099e1062b49b8710c2230d5128c","observation_id":"d44a5a8c-a60a-436b-907d-913b40b5fd57","resolution":{"observed_at":"2026-07-06T04:31:56.995473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.000553Z","title":"A matheuristic for solving the single row facility layout problem , journal =","venue":null,"work_id":"d71f5396-a0ad-444b-8acd-1865a3795efc","year":2026},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:75355ad07ad0ed558cf63a8c75715cbab46dbfe2b0ae1791e1d7b57eee79d236","observation_id":"ef03b35d-3515-4f46-a5de-dbba04a6e4e8","resolution":{"observed_at":"2026-07-06T04:31:57.001983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.006668Z","title":"An oscillation based simulated annealing algorithm for the single row facility layout problem , journal =","venue":null,"work_id":"366c36d8-3b4c-4888-a3d7-8a9628099273","year":2025},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:f6d49bac667fdab531f2fb624752f311c0f71f76666ca48a55e886d1d7842e88","observation_id":"3556eb54-610d-4667-9160-6805eea1ddd4","resolution":{"observed_at":"2026-07-06T04:31:57.008181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.983402Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"8a3914ac-eba6-45ba-8ede-7567cbd434c0","year":2010},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:d1fb416d90890d4a0400caa5c7dc98574b7e6178d9b076f602034c256bbb9d0a","observation_id":"489b838d-bef0-4414-8d3b-b8613d1a540c","resolution":{"observed_at":"2026-07-06T04:31:56.987161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.134249Z","title":"The MOSEK Optimizer API for Julia manual","venue":null,"work_id":"671c47f0-264b-4d73-bf5d-69e7d2276a35","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:ac75a426fb955d62ba78bd4b790a71a61434a16181bc70c4623af123dbb99dea","observation_id":"d2122d41-5fcc-4b39-9697-485614e5a736","resolution":{"observed_at":"2026-07-06T04:31:57.135954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:57.153600Z","title":"and Amaral, André R","venue":null,"work_id":"d0681f4c-aff0-47a4-a7f2-e27dde7e9b9e","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:18416a5685291f913325504091a27220d6732ddfe64ee2f5c2f1e61bc569e0fe","observation_id":"4b2b88ca-129f-4cc5-9318-fa456544fcd5","resolution":{"observed_at":"2026-07-06T04:31:57.155015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.980573Z","title":", journal=","venue":null,"work_id":"0a715c8b-e813-46c6-802d-276b57647b09","year":2023},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:fd7f434df8e2884e90491ed35980d1a06fd624c3176e9a1f60fb9759d1e89ac7","observation_id":"995f3ed5-b120-45cb-b299-8c3a4848bee0","resolution":{"observed_at":"2026-07-06T04:31:56.982761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.988098Z","title":"2017 , optissn =","venue":null,"work_id":"25014a1f-ef4f-44e1-ad3d-c0abdca7a1d4","year":2017},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:a20da6edddb9ab3254df928ec940dce82b642e915d291ce9c433be305cf6b24e","observation_id":"ed1662a9-62b9-4d79-b09c-4165e1605822","resolution":{"observed_at":"2026-07-06T04:31:56.989241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:31:56.990182Z","title":"Variants of the","venue":null,"work_id":"2c90ec20-0a68-49cb-b33e-17134f37fbfd","year":null},"citing_paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-02T08:42:06.224999Z"},"links":{"citing_paper":"/paper/2607.00611"},"observation_digest":"sha256:4bb4a6eacfe5c6eaeb42bdc07041e4f191f8e0c36f9b9cd480033585d6fe5ebf","observation_id":"0057db76-4ec0-4acd-8659-bb800f50b6e7","resolution":{"observed_at":"2026-07-06T04:31:56.991543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00611","last_updated":"2026-07-01T08:35:17Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T08:03:19.863659Z","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem"},"reference_resolution":{"displayed":90,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":83},"total_outbound_references":90},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 90 of 90 outbound references and 0 inbound Pith citation observations for arXiv:2607.00611."}