FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3194074258> ?p ?o ?g. }

• W3194074258 abstract "Extended formulations are now widely used to solve hard combinatorial optimization problems. Such formulations have prohibitively-many variables and are generally solved via Column Generation (CG). CG algorithms are known to have frequent convergence issues, and, up to a sometimes large number of iterations, classical Lagrangian dual bounds may be weak. This paper is devoted to set-covering problems in which all elements to cover require a given emph{resource consumption} and all feasible configurations have to verify a emph{resource constraint}. We propose an iterative aggregation method for determining convergent dual bounds using the extended formulation of such problems. The set of dual variables is partitioned into $k$ groups and all variables in each group are artificially linked using the following groupwise restriction: the dual values in a group have to follow a linear function of their corresponding resource consumptions. This leads to a restricted model of smaller dimension, with only $2k$ dual variables. The method starts with one group ($k=1$) and iteratively splits the groups. Our algorithm has three advantages: (i) it produces good dual bounds even for low $k$ values, (ii) it reduces the number of dual variables, and (iii) it may reduce the time needed to solve sub-problems, in particular when dynamic programming is used. We experimentally tested our approach on two variants of the cutting-stock problem: in many cases, the method produces near optimal dual bounds after a small number of iterations. Moreover the average computational effort to reach the optimum is reduced compared to a classical column generation algorithm." @default.
• W3194074258 created "2021-08-30" @default.
• W3194074258 creator A5039674040 @default.
• W3194074258 creator A5046556052 @default.
• W3194074258 date "2013-12-13" @default.
• W3194074258 modified "2023-10-16" @default.
• W3194074258 title "Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems" @default.
• W3194074258 cites W1948965050 @default.
• W3194074258 cites W1966716113 @default.
• W3194074258 cites W1970355999 @default.
• W3194074258 cites W1976015715 @default.
• W3194074258 cites W1982862520 @default.
• W3194074258 cites W1984804966 @default.
• W3194074258 cites W1992439238 @default.
• W3194074258 cites W2002284890 @default.
• W3194074258 cites W2005431820 @default.
• W3194074258 cites W2007786724 @default.
• W3194074258 cites W2032938251 @default.
• W3194074258 cites W2033394039 @default.
• W3194074258 cites W2038700684 @default.
• W3194074258 cites W2050001280 @default.
• W3194074258 cites W2057459863 @default.
• W3194074258 cites W2058653357 @default.
• W3194074258 cites W2064026043 @default.
• W3194074258 cites W2072078883 @default.
• W3194074258 cites W2079905850 @default.
• W3194074258 cites W2085478109 @default.
• W3194074258 cites W2091565303 @default.
• W3194074258 cites W2127777220 @default.
• W3194074258 cites W2144946856 @default.
• W3194074258 cites W2159784590 @default.
• W3194074258 cites W2160028988 @default.
• W3194074258 cites W2241927630 @default.
• W3194074258 cites W3023456609 @default.
• W3194074258 hasPublicationYear "2013" @default.
• W3194074258 type Work @default.
• W3194074258 sameAs 3194074258 @default.
• W3194074258 citedByCount "0" @default.
• W3194074258 crossrefType "posted-content" @default.
• W3194074258 hasAuthorship W3194074258A5039674040 @default.
• W3194074258 hasAuthorship W3194074258A5046556052 @default.
• W3194074258 hasBestOaLocation W31940742581 @default.
• W3194074258 hasConcept C126255220 @default.
• W3194074258 hasConcept C138885662 @default.
• W3194074258 hasConcept C177264268 @default.
• W3194074258 hasConcept C199360897 @default.
• W3194074258 hasConcept C2780980858 @default.
• W3194074258 hasConcept C33923547 @default.
• W3194074258 hasConcept C41008148 @default.
• W3194074258 hasConcept C41895202 @default.
• W3194074258 hasConceptScore W3194074258C126255220 @default.
• W3194074258 hasConceptScore W3194074258C138885662 @default.
• W3194074258 hasConceptScore W3194074258C177264268 @default.
• W3194074258 hasConceptScore W3194074258C199360897 @default.
• W3194074258 hasConceptScore W3194074258C2780980858 @default.
• W3194074258 hasConceptScore W3194074258C33923547 @default.
• W3194074258 hasConceptScore W3194074258C41008148 @default.
• W3194074258 hasConceptScore W3194074258C41895202 @default.
• W3194074258 hasLocation W31940742581 @default.
• W3194074258 hasLocation W31940742582 @default.
• W3194074258 hasLocation W31940742583 @default.
• W3194074258 hasLocation W31940742584 @default.
• W3194074258 hasLocation W31940742585 @default.
• W3194074258 hasLocation W31940742586 @default.
• W3194074258 hasOpenAccess W3194074258 @default.
• W3194074258 hasPrimaryLocation W31940742581 @default.
• W3194074258 hasRelatedWork W1587224694 @default.
• W3194074258 hasRelatedWork W1979597421 @default.
• W3194074258 hasRelatedWork W2007980826 @default.
• W3194074258 hasRelatedWork W2061531152 @default.
• W3194074258 hasRelatedWork W2077600819 @default.
• W3194074258 hasRelatedWork W2748952813 @default.
• W3194074258 hasRelatedWork W2899084033 @default.
• W3194074258 hasRelatedWork W3002753104 @default.
• W3194074258 hasRelatedWork W4225152035 @default.
• W3194074258 hasRelatedWork W4245490552 @default.
• W3194074258 isParatext "false" @default.
• W3194074258 isRetracted "false" @default.
• W3194074258 magId "3194074258" @default.
• W3194074258 workType "article" @default.