Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Arne Herzel"'
Publikováno v:
Journal of Combinatorial Optimization. 44:1459-1494
In a widely-studied class of multi-parametric optimization problems, the objective value of each solution is an affine function of real-valued parameters. Then, the goal is to provide an optimal solution set, i.e., a set containing an optimal solutio
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously considering
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc9c7625cef926fb5d0e1ffea0aaa3ae
http://arxiv.org/abs/2109.10067
http://arxiv.org/abs/2109.10067
Publikováno v:
INFORMS Journal on Computing.
Algorithms for approximating the nondominated set of multiobjective optimization problems are reviewed. The approaches are categorized into general methods that are applicable under mild assumptions and, thus, to a wide range of problems, and into al
Publikováno v:
Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2021, 80 (1), pp.87-115. ⟨10.1007/s10898-020-00951-7⟩
Journal of Global Optimization, Springer Verlag, 2021, 80 (1), pp.87-115. ⟨10.1007/s10898-020-00951-7⟩
Papadimitriou and Yannakakis (Proceedings of the 41st annual IEEE symposium on the Foundations of Computer Science (FOCS), pp 86–92, 2000) show that the polynomial-time solvability of a certain auxiliary problem determines the class of multiobjecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8f55fc08801f836e80c6e119564a7c4
https://hal.archives-ouvertes.fr/hal-03118377
https://hal.archives-ouvertes.fr/hal-03118377
Publikováno v:
Journal of Scheduling. 22:359-377
We study a game theoretical model of multistage interval scheduling problems in which each job consists of exactly one task (interval) for each of t stages (machines). In the game theoretical model, the machine of each stage is controlled by a differ
In a (linear) parametric optimization problem, the objective value of each feasible solution is an affine function of a real-valued parameter and one is interested in computing a solution for each possible value of the parameter. For many important p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32ef740d254f2c0ba55d93b3091c3e76
https://mediatum.ub.tum.de/doc/1586223/document.pdf
https://mediatum.ub.tum.de/doc/1586223/document.pdf
Publikováno v:
Computing and Combinatorics 25th International Conference, COCOON 2019, Proceedings
25th International Conference, COCOON 2019
25th International Conference, COCOON 2019, Jul 2019, Xi'an, China. pp.25-37, ⟨10.1007/978-3-030-26176-4_3⟩
Lecture Notes in Computer Science ISBN: 9783030261757
COCOON
25th International Conference, COCOON 2019
25th International Conference, COCOON 2019, Jul 2019, Xi'an, China. pp.25-37, ⟨10.1007/978-3-030-26176-4_3⟩
Lecture Notes in Computer Science ISBN: 9783030261757
COCOON
Lecture Notes in Computer Science book series (LNCS, volume 11653); In a (linear) parametric optimization problem, the objective value of each feasible solution is an affine function of a real-valued parameter and one is interested in computing a sol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c96f80f0cc337c7822749b7fec6711f
https://hal.archives-ouvertes.fr/hal-02309541
https://hal.archives-ouvertes.fr/hal-02309541