Paweł Zieliński

Works:

Recoverable robust spanning tree problem under interval uncertainty representations
Single machine scheduling problems with uncertain parameters and the OWA criterion
Risk-averse single machine scheduling: complexity and approximation
The recoverable robust spanning tree problem with interval costs is polynomially solvable

All Objects (5)

External links:

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read and agree to the privacy policy for the collection of personal data.*

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Paweł Zieliński

Works:

External links:

Reset password