( en | de | ru )

 

Disambiguation of "Fleszar, Krzysztof"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions

, , , , and . Electronic Colloquium Computat. Complexity (ECCC), (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Krzysztof Swiatek

Krzysztof Kurek

Krzysztof Czubak

Krzysztof Appelt

Krzysztof Oplustil

 

Other publications of authors with the same name

New algorithms for maximum disjoint paths based on tree-likeness, , and . Mathematical Programming, (Nov 14, 2017)An evolutionary algorithm for resource-constrained project scheduling., , and . IEEE Trans. Evol. Comput., 6 (5): 512-518 (2002)Network-Design Problems in Graphs and on the Plane.. Julius Maximilians University Würzburg, Germany, (2018)Polylogarithmic Approximation for Generalized Minimum Manhattan Networks, , , , , and . Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13), Braunschweig, (March 2013)Complementation of Multihead Automata. Bachelor thesis, Lehrstuhl für Informatik IV, Universität Würzburg, (July 2010)A PTAS for Euclidean TSP with Hyperplane Neighborhoods., , , and . SODA, page 1089-1105. SIAM, (2019)An enumerative heuristic and reduction methods for the assembly line balancing problem., and . Eur. J. Oper. Res., 145 (3): 606-620 (2003)An effective heuristic for the CLSP with set-up times., , and . JORS, 54 (5): 490-498 (2003)New Algorithms for Disjoint Paths Based on Tree-Likeness, , and . Proc. 24th European Symposium on Algorithms (ESA '16), page 42:1--42:17. (2016)Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours., , , and . CoRR, (2022)