Matches in SemOpenAlex for { <https://semopenalex.org/work/W4299867868> ?p ?o ?g. }
Showing items 1 to 51 of
51
with 100 items per page.
- W4299867868 abstract "In the recent paper cite{BDT10} we introduced a new problem that we call Bin Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this expression that we look for not only a good, but a good and fast packing or covering. In that paper we mainly dealt with only one possible online BP/CD model, and proposed a new method that we call the Evolution of Algorithms. In case of such methods a neighborhood structure is defined among algorithms, and using a metaheuristic (for example simulated annealing) in some sense the best algorithm is chosen to solve the problem. Now we turn to investigate the offline case. We define several ways to treat such a BP/CD problem, although we investigate only one of them here. For the analysis, a novel view on offline optimum is introduced, which appears to be relevant concerning all problems where a final solution is ordering-dependent. We prove that if the item sizes are not allowed to be arbitrarily close to zero, then an optimal offline solution can be found in polynomial time. On the other hand, for unrestricted problem instances, no polynomial-time algorithm can achieve an approximation ratio better than 6/7 if $Pne NP$." @default.
- W4299867868 created "2022-10-03" @default.
- W4299867868 creator A5026437192 @default.
- W4299867868 creator A5069718437 @default.
- W4299867868 date "2012-07-24" @default.
- W4299867868 modified "2023-09-26" @default.
- W4299867868 title "Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms" @default.
- W4299867868 doi "https://doi.org/10.48550/arxiv.1207.5672" @default.
- W4299867868 hasPublicationYear "2012" @default.
- W4299867868 type Work @default.
- W4299867868 citedByCount "0" @default.
- W4299867868 crossrefType "posted-content" @default.
- W4299867868 hasAuthorship W4299867868A5026437192 @default.
- W4299867868 hasAuthorship W4299867868A5069718437 @default.
- W4299867868 hasBestOaLocation W42998678681 @default.
- W4299867868 hasConcept C109718341 @default.
- W4299867868 hasConcept C11413529 @default.
- W4299867868 hasConcept C126255220 @default.
- W4299867868 hasConcept C126980161 @default.
- W4299867868 hasConcept C130253271 @default.
- W4299867868 hasConcept C156273044 @default.
- W4299867868 hasConcept C311688 @default.
- W4299867868 hasConcept C33923547 @default.
- W4299867868 hasConcept C41008148 @default.
- W4299867868 hasConcept C87219788 @default.
- W4299867868 hasConceptScore W4299867868C109718341 @default.
- W4299867868 hasConceptScore W4299867868C11413529 @default.
- W4299867868 hasConceptScore W4299867868C126255220 @default.
- W4299867868 hasConceptScore W4299867868C126980161 @default.
- W4299867868 hasConceptScore W4299867868C130253271 @default.
- W4299867868 hasConceptScore W4299867868C156273044 @default.
- W4299867868 hasConceptScore W4299867868C311688 @default.
- W4299867868 hasConceptScore W4299867868C33923547 @default.
- W4299867868 hasConceptScore W4299867868C41008148 @default.
- W4299867868 hasConceptScore W4299867868C87219788 @default.
- W4299867868 hasLocation W42998678681 @default.
- W4299867868 hasOpenAccess W4299867868 @default.
- W4299867868 hasPrimaryLocation W42998678681 @default.
- W4299867868 hasRelatedWork W1994874668 @default.
- W4299867868 hasRelatedWork W2011975910 @default.
- W4299867868 hasRelatedWork W2013702104 @default.
- W4299867868 hasRelatedWork W2055354186 @default.
- W4299867868 hasRelatedWork W2102615229 @default.
- W4299867868 hasRelatedWork W2397910085 @default.
- W4299867868 hasRelatedWork W2549217229 @default.
- W4299867868 hasRelatedWork W3002627114 @default.
- W4299867868 hasRelatedWork W3157479109 @default.
- W4299867868 hasRelatedWork W4200494428 @default.
- W4299867868 isParatext "false" @default.
- W4299867868 isRetracted "false" @default.
- W4299867868 workType "article" @default.