Log in to save to my catalogue

Submodularity in Conic Quadratic Mixed 0–1 Optimization

Submodularity in Conic Quadratic Mixed 0–1 Optimization

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_informs_primary_10_1287_opre_2019_1888

Submodularity in Conic Quadratic Mixed 0–1 Optimization

About this item

Full title

Submodularity in Conic Quadratic Mixed 0–1 Optimization

Publisher

Linthicum: INFORMS

Journal title

Operations research, 2020-03, Vol.68 (2), p.609-630, Article opre.2019.1888

Language

English

Formats

Publication information

Publisher

Linthicum: INFORMS

More information

Scope and Contents

Contents

Although submodularity has played an important role in developing efficient algorithms for numerous combinatorial optimization problems, its use in mixed 0–1 optimization has been rather limited. In “Submodularity in Conic Quadratic Mixed 0-1 Optimization,” Atamtürk and Gómez derive strong valid inequalities for conic quadratic mixed 0–1 optimizati...

Alternative Titles

Full title

Submodularity in Conic Quadratic Mixed 0–1 Optimization

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_informs_primary_10_1287_opre_2019_1888

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_informs_primary_10_1287_opre_2019_1888

Other Identifiers

ISSN

0030-364X

E-ISSN

1526-5463

DOI

10.1287/opre.2019.1888

How to access this item