Author of the publication

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem.

, , , , , , , , , , , and . ICAPS, page 541-554. AAAI Press, (2019)

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.

 

Other publications of authors with the same name

Ultra-Fast Load Balancing on Scale-Free Networks., , , , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 516-527. Springer, (2015)Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem., , , , , , , , , and 2 other author(s). ICAPS, page 541-554. AAAI Press, (2019)Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints., , , , and . CoRR, (2018)Memory-Restricted Routing with Tiled Map Data., , , , , , , , , and . SMC, page 3347-3354. IEEE, (2018)Greed is Good for Deterministic Scale-Free Networks., , and . FSTTCS, volume 65 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Dominating an s-t-Cut in a Network., , and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 401-411. Springer, (2015)Routing for on-street parking search using probabilistic data., , , , , , , and . AI Commun., 32 (2): 113-124 (2019)The Satisfiability Threshold for Non-Uniform Random 2-SAT., and . ICALP, volume 132 of LIPIcs, page 61:1-61:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints., , , , and . AAAI, page 2272-2279. AAAI Press, (2019)Probabilistic Routing for On-Street Parking Search., , , , , , , and . ESA, volume 57 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)