A branch-and-cut algorithm for submodular interdiction games

Kübra Tanınmış, Markus Sinnl

Year of publication:	2022
Authors:	Tanınmış, Kübra ; Sinnl, Markus
Published in:	INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 5, p. 2634-2657
Subject:	bilevel optimization \| branch-and-cut \| interdiction games \| submodular optimization \| Spieltheorie \| Game theory \| Mathematische Optimierung \| Mathematical programming \| Algorithmus \| Algorithm \| Ganzzahlige Optimierung \| Integer programming

Online Resource

Check full text access |

More access options

doi.org

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10014325544

A service of the