Timeline for Optimization problem over bidirectional connected graph
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 29, 2021 at 17:56 | vote | accept | dcfg | ||
| Jan 21, 2021 at 20:53 | comment | added | D.W.♦ | @dc_Bita98, your objective function is to minimize the number of trays, so in the language of the knapsack each tray counts equally (it has the same value, i.e., same profit). There are separate constraints regarding what subsets of trays are allowable (they have to provide enough of the items needed in the orders). | |
| Jan 21, 2021 at 20:23 | comment | added | dcfg | That's interesting. I was definitely focused on graph theory so I haven't even thought about knapsack. There's a thing I don't get though: when you say "each item (tray) has the same value"... Actually I think the value of a tray depends on items it contains. Maybe I'm misunderstanding you | |
| Jan 21, 2021 at 18:36 | history | answered | D.W.♦ | CC BY-SA 4.0 |