arXiv (OAI Expanded)
open access
Maximum-Weight Two Boxes Symmetric Difference Problem
Let $P$ be a set of $n$ weighted points in the plane. We study optimization with axis-aligned rectangles under objectives determined by the incidence pattern of each point with the selected rectangles. As a central case, we consider two possibly overlapping rectangles maximizing the total weight of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extremal problems for cancellative and locally thin hypergraphs#986484
- An exact and fast solution of the inverse Regularized Optimal Transport problem#821231
- Multidimensional Sorting: Comparative Statics#635694
- Multidimensional Sorting: Comparative Statics#633345
- A computational comparison of handling distance constraints in MINLP#1166167
Record · ID 1084218
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive