Timeline for How to formulate fleet Assignment Problem?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2022 at 6:43 | vote | accept | Optimization team | ||
| Aug 9, 2022 at 2:56 | history | edited | SecretAgentMan | CC BY-SA 4.0 |
Removed "Thanks" due to https://meta.stackexchange.com/questions/2950/should-hi-thanks-taglines-and-salutations-be-removed-from-posts
|
| Aug 8, 2022 at 12:07 | answer | added | LINDO Systems | timeline score: 1 | |
| Aug 6, 2022 at 7:55 | history | edited | Optimization team |
edited tags
|
|
| Aug 6, 2022 at 7:39 | comment | added | Kuifje | Consider the lines of your diagram as nodes of a graph, and link two such nodes $u$, $v$ if 1/ $u$, $v$ are in the same location 2/ arrival time at $u$ is smaller than departure time at $v$. Add a source and sink and connect to all nodes, and connect the sink to the source. You could then minimize the cost from sink to source, while imposing a unit of flow (or possibly more if capacity is met) on each flight. | |
| Aug 6, 2022 at 7:31 | history | asked | Optimization team | CC BY-SA 4.0 |