Publications

A Study on the Computational Complexity of the Bilevel Knapsack Problem

AuthID
P-009-ND5

Author(s)

Caprara, A

Carvalho, M

Lodi, A

Woeginger, GJ

Document Type

Article

Year published

2014

Published

in SIAM JOURNAL ON OPTIMIZATION, ISSN: 1052-6234

Volume: 24, Issue: 2, Pages: 823-838 (16)

Indexing

Wos^®

Scopus^®

Crossref^®

Google Scholar^®

Publication Identifiers

DOI: 10.1137/130906593

Scopus: 2-s2.0-84905377921

Wos: WOS:000338828800012

Source Identifiers

ISSN: 1052-6234

Export Publication Metadata

Marked List

Add to Marked List

Citations

Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

CORE Conference

No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors

Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Full Text

Full Text @ sfx.b-on.pt

A Study on the Computational Complexity of the Bilevel Knapsack Problem

Useful Links

Get Help

Federated Authentication (Click on the image)

A Study on the Computational Complexity of the Bilevel Knapsack Problem

Useful Links

Get Help