Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Algorithms for robust discrete optimization

2013/09/B/ST6/01525

Keywords:

robust optimization discrete optimization computational complexity approximation algorithms

Descriptors:

  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Politechnika Wrocławska, Wydział Informatyki i Zarządzania

woj. dolnośląskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr hab. Adam Kasperski 

Number of co-investigators in the project: 3

Call: OPUS 5 - announced on 2013-03-15

Amount awarded: 395 460 PLN

Project start date (Y-m-d): 2014-03-20

Project end date (Y-m-d): 2017-03-19

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Information in the final report

  • Publication in academic press/journals (8)
  • Articles in post-conference publications (5)
  • Book publications / chapters in book publications (1)
  1. Approximability of the robust representatives selection problem
    Authors:
    Adam Kasperski, Adam Kurpisz, Paweł Zieliński
    Academic press:
    Operations Research Letters (rok: 2015, tom: 43, strony: 16-19), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.007 - link to the publication
  2. Robust recoverable and two-stage selection problems
    Authors:
    Adam Kasperski, Paweł Zieliński
    Academic press:
    Discrete Applied Mathematics (rok: 2017, tom: 233, strony: 52-64), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2017.08.014 - link to the publication
  3. Complexity of the robust weighted independent set problems on interval graphs
    Authors:
    Adam Kasperski, Paweł Zieliński
    Academic press:
    Optimization Letters (rok: 2015, tom: 9, strony: 427-436), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s11590-014-0773-3 - link to the publication
  4. Recoverable robust spanning tree problem under interval uncertainty representations
    Authors:
    Mikita Hradovich, Adam Kasperski, Paweł Zieliński
    Academic press:
    Journal of Combinatorial Optimization (rok: 2017, tom: 34, strony: 554-573), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-016-0089-6 - link to the publication
  5. Single machine scheduling problems with uncertain parameters and the OWA criterion
    Authors:
    Adam Kasperski, Paweł Zieliński
    Academic press:
    Journal of Scheduling (rok: 2016, tom: 19, strony: 177-190), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10951-015-0444-y - link to the publication
  6. The robust recoverable spanning tree problem with interval costs is polynomially solvable
    Authors:
    Mikita Hradovich, Adam Kasperski, Paweł Zieliński
    Academic press:
    Optimization Letters (rok: 2017, tom: 11, strony: 17-30), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s11590-016-1057-x - link to the publication
  7. Using the WOWA operator in robust discrete optimization problems
    Authors:
    Adam Kasperski, Paweł Zieliński
    Academic press:
    International Journal of Approximate Reasonning (rok: 2016, tom: 68, strony: 54-67), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.005 - link to the publication
  8. Combinatorial optimization problems with uncertain costs and the OWA criterion
    Authors:
    Adam Kasperski, Paweł Zieliński
    Academic press:
    Theoretical Computer Science (rok: 2015, tom: 565, strony: 102-112), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2014.11.013 - link to the publication
  1. A robust approach to a class of uncertain optimization problems with imprecise probabilities
    Authors:
    Adam Kasperski, Paweł Zieliński
    Conference:
    IEEE World Congress on Computational Intelligence, Vancouver 2016 (rok: 2016, ), Wydawca: IEEE
    Data:
    konferencja 24-29 lipca
    Status:
    Published
  2. Approximation Schemes for Robust Makespan Scheduling Problems
    Authors:
    Adam Kurpisz
    Conference:
    International Annual Conference on Operational Research, OR 2014, Aachen (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 2-5 września 2014
    Status:
    Published
  3. Robust discrete optimization problems with the WOWA criterion
    Authors:
    Adam Kasperski, Paweł Zieliński
    Conference:
    International Conference on Operational Research, OR 2014, Aachen (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 2-5 września 2014
    Status:
    Published
  4. Robust single machine scheduling problem with weighted number of late jobs criterion
    Authors:
    Adam Kasperski, Paweł Zieliński
    Conference:
    International Conference on Operational Research, OR 2014, Aachen (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 2-5 września 2014
    Status:
    Published
  5. Robust two-stage network problems
    Authors:
    Adam Kasperski, Paweł Zieliński
    Conference:
    International Conference on Operations Research, OR 2015, Vienna (rok: 2017, ), Wydawca: Springer
    Data:
    konferencja 1-4 września 2015
    Status:
    Published
  1. Robust discrete optimization under discrete and interval uncertainty - a survey
    Authors:
    Adam Kasperski, Paweł Zieliński
    Book:
    Robustness Analysis in Decision Aiding, Optimization, and Analytics. International Series in Operations Research & Management Science (rok: 2016, tom: 241, strony: 113-143), Wydawca: Springer
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy