Fractional 0–1 programming and submodularity

In this note we study multiple-ratio fractional 0–1 programs, a broad class of NP -hard combinatorial optimization problems. In particular, under some relatively mild assumptions we provide a complete characterization of the conditions, which ensure that a single-ratio function is submodular. Then w...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 84; no. 1; pp. 77 - 93
Main Authors Han, Shaoning, Gómez, Andrés, Prokopyev, Oleg A.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.09.2022
Springer
Springer Nature B.V
Subjects
Algorithms
Approximation
Combinatorial analysis
Computer Science
Greedy algorithms
Industrial locations
Integer programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
Facility location
Fractional 0–1 programming
Single ratio
Hyperbolic 0–1 programming
Assortment optimization
Greedy algorithm
Multiple ratios
Submodularity
Online AccessGet full text

Cover

More Information
Summary:In this note we study multiple-ratio fractional 0–1 programs, a broad class of NP -hard combinatorial optimization problems. In particular, under some relatively mild assumptions we provide a complete characterization of the conditions, which ensure that a single-ratio function is submodular. Then we illustrate our theoretical results with the assortment optimization and facility location problems, and discuss practical situations that guarantee submodularity in the considered application settings. In such cases, near-optimal solutions for multiple-ratio fractional 0–1 programs can be found via simple greedy algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-022-01131-5