A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128898173, #quickstatements; #temporary_batch_1723847594352 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2018.11.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2018.11.017 / rank | |||
Normal rank | |||
Latest revision as of 23:46, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and fast algorithm for convex decomposition in relax-and-round mechanisms |
scientific article |
Statements
A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (English)
0 references
17 December 2018
0 references
algorithmic mechanism design
0 references
approximation algorithms
0 references
logistics
0 references
linear programming
0 references
0 references
