Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Olaf E. Flippo"'
Publikováno v:
European Journal of Operational Research. 127:189-202
In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satisfied by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0175297d06027af2e4721d711ebc9408
https://doi.org/10.1016/s0377-2217(99)00340-9
https://doi.org/10.1016/s0377-2217(99)00340-9
Publikováno v:
European Journal of Operational Research. 98:457-472
In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df11a9389b92393bb748c5315d97b6c0
https://doi.org/10.1016/s0377-2217(96)00228-7
https://doi.org/10.1016/s0377-2217(96)00228-7
Autor:
Benjamin Jansen, Olaf E. Flippo
Publikováno v:
European Journal of Operational Research. 94:167-178
In this paper a duality framework is discussed for the problem of optimizing a nonconvex quadratic function over an ellipsoid. Additional insight is obtained from the observation that this nonconvex problem is in a sense equivalent to a convex proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d2cef93ea388811de2e60e6a3601f00
https://doi.org/10.1016/0377-2217(95)00199-9
https://doi.org/10.1016/0377-2217(95)00199-9
Publikováno v:
Mathematical Programming. 60:361-382
In this paper a unifying framework is presented for the generalization of the decomposition methods originally developed by Benders (1962) and Dantzig and Wolfe (1960). These generalizations, calledVariable Decomposition andConstraint Decomposition r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83aec22d3cdac2e88ee7db9236f12805
https://doi.org/10.1007/bf01580620
https://doi.org/10.1007/bf01580620
Publikováno v:
Operations Research Letters. 9:81-83
In this note two decomposition methods are improved for Mixed-Integer Quadratic Programs, developed by E. Balas and R. Lazimy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e01ce2389142983e450a03129412e7
https://doi.org/10.1016/0167-6377(90)90045-7
https://doi.org/10.1016/0167-6377(90)90045-7
The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the specification of the order in which components are to be placed on the board, and the assignment of comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1147e8789ad3609e2f07caa2895e3bcb
http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:d09d1962-5d80-49d7-8f47-c86c7a51a9a4/datastreams/ASSET1/content
http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:d09d1962-5d80-49d7-8f47-c86c7a51a9a4/datastreams/ASSET1/content
Publikováno v:
Combinatorial Optimization ISBN: 9783642774911
Decomposition has been recognized as a fundamental technique in optimization ever since the seminal papers of Benders (1962) and Dantzig & Wolfe (1960). The literature abounds with theoretical extensions of these two basic approaches, as well as with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe4619db75938993be472beb1a307448
https://doi.org/10.1007/978-3-642-77489-8_1
https://doi.org/10.1007/978-3-642-77489-8_1