Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Angelos Tsoukalas"'
Autor:
Angelos Tsoukalas, Kalyan Talluri
Publikováno v:
Operations Research. INFORMS Institute for Operations Research and the Management Sciences
Professional service firms (PSFs) such as management consulting, law, accounting, investment banking, architecture, advertising, and home-repair companies provide services for complicated turnkey projects. A firm bids for a project and, if successful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8429e7155892d7c33bee77209ee20b0
https://doi.org/10.1287/opre.2022.2351
https://doi.org/10.1287/opre.2022.2351
Publikováno v:
Operations Research, 68, 572-590. INFORMS Institute for Operations Research and the Management Sciences
Two-stage robust optimization problems, in which decisions are taken both in anticipation ofand in response to the observation of an unknown parameter vector from within an uncertaintyset, are notoriously challenging. In this paper, we develop conver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5ba1000dc7f9778b9f3528ff372e001
https://doi.org/10.1287/opre.2019.1873
https://doi.org/10.1287/opre.2019.1873
Autor:
Kalyan T. Talluri, Angelos Tsoukalas
Publikováno v:
SSRN Electronic Journal.
Professional service firms (PSFs) such as management consulting, law, accounting, investment banking, architecture, advertising and home-repair companies provide services for turnkey complicated projects. The operational tasks of such firms consists
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc25b4114d4e03593a45ff144057f7bf
https://doi.org/10.2139/ssrn.3629128
https://doi.org/10.2139/ssrn.3629128
Publikováno v:
Journal of Optimization Theory and Applications. 167:558-584
We propose an algorithm for solving the surrogate dual of a mixed integer program. The algorithm uses a trust region method based on a piecewise affine model of the dual surrogate value function. A new and much more flexible way of updating bounds on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3f20b536d02b33930ef29b834c992a0
https://doi.org/10.1007/s10957-014-0681-9
https://doi.org/10.1007/s10957-014-0681-9
Autor:
Angelos Tsoukalas, Belmiro P.M. Duarte
Publikováno v:
Computers & Operations Research. 41:223-230
We propose a systematic algorithm to tackle a set of acceptance sampling problems introduced by Seidel [1] and their generalization when no prior knowledge is assumed. The problems are modeled as minimax problems with coupled or decoupled constraints
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22145687d3e36dd7744789bd94a40898
https://doi.org/10.1016/j.cor.2013.07.009
https://doi.org/10.1016/j.cor.2013.07.009
Autor:
Berç Rustem, Angelos Tsoukalas
Publikováno v:
Optimization Letters. 5:705-716
Discretization methods for semi-infinite programming do not provide a feasible point in a finite number of iterations. We propose a method that computes a feasible point with an objective value better than or equal to a target value f0 or proves that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aeecb76336066dbd066276b34d1206f5
https://doi.org/10.1007/s11590-010-0236-4
https://doi.org/10.1007/s11590-010-0236-4
Autor:
Taghi Miri, Berç Rustem, Serafim Bakalis, Efstratios N. Pistikopoulos, Peter J. Fryer, Angelos Tsoukalas
Publikováno v:
Journal of Food Engineering. 87:485-494
Conventionally, food is significantly over-processed to ensure safety. Dynamic optimization can be used to compute optimal thermal operation condition to ensure maximum product quality while assuring food safety. Local optimization (LO) algorithms ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5258545bcfa002d61dc561037b3049b
https://doi.org/10.1016/j.jfoodeng.2007.12.032
https://doi.org/10.1016/j.jfoodeng.2007.12.032
Publikováno v:
Journal of Global Optimization. 44:235-250
We propose an algorithm for the global optimization of three problem classes: generalized semi-infinite, continuous coupled minimax and bi-level problems. We make no convexity assumptions. For each problem class, we construct an oracle that decides w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c541e1816b509a14572ff515cad1b6a7
https://doi.org/10.1007/s10898-008-9321-y
https://doi.org/10.1007/s10898-008-9321-y
Publikováno v:
Optimization Letters. 3:49-62
We generalize a smoothing algorithm for finite min–max to finite min–max–min problems. We apply a smoothing technique twice, once to eliminate the inner min operator and once to eliminate the max operator. In mini–max problems, where only the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c79d772c97a11c235eb50a3754b8167
https://doi.org/10.1007/s11590-008-0090-9
https://doi.org/10.1007/s11590-008-0090-9
Autor:
Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Matteo Fischetti, Martin W. P. Savelsbergh, Angelos Tsoukalas
Publikováno v:
Mathematical Programming Computation, 6, 255-279. Springer-Verlag
The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a341a3de21f92a9447297f22ba79f0c
https://pure.eur.nl/en/publications/d94dd3e4-5abb-4533-a3cd-3d3fb94ba362
https://pure.eur.nl/en/publications/d94dd3e4-5abb-4533-a3cd-3d3fb94ba362
