Fractional 0-1 programming and submodularity
From MaRDI portal
Publication:2162513
DOI10.1007/s10898-022-01131-5zbMath1496.90101arXiv2012.07235OpenAlexW4210457748MaRDI QIDQ2162513
Shaoning Han, Oleg A. Prokopyev, Andrés Gómez
Publication date: 8 August 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.07235
greedy algorithmsubmodularityfacility locationassortment optimizationfractional 0-1 programminghyperbolic 0-1 programmingmultiple ratiossingle ratio
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Maximizing a class of submodular utility functions
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Exact solution of a class of nonlinear knapsack problems
- Exact approaches for competitive facility location with discrete attractiveness
- A PTAS for capacitated sum-of-ratios optimization
- Polymatroids and mean-risk minimization in discrete optimization
- The set covering problem with linear fractional functional
- Hyperbolic 0-1 programming and query optimization in information retrieval
- A new saling algorithm for the maximum mean cut problem
- Boolean query optimization and the 0-1 hyperbolic sum problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- On complexity of unconstrained hyperbolic 0--1 programming problems
- On upper bounds for assortment optimization under the mixture of multinomial logit models
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Global optimization of 0-1 hyperbolic programs
- The maximum capture problem with random utilities: problem formulation and algorithms
- The theory and practice of revenue management
- An exact method for assortment optimization under the nested logit model
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- The maximum ratio clique problem
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Combinatorial Optimization with Rational Objective Functions
- Market Segmentation, Cannibalization, and the Timing of Product Introductions
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- Minimal ratio spanning trees
- An analysis of approximations for maximizing submodular set functions—I
- Tractable Approximations for Assortment Planning with Product Costs
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- Maximizing a Class of Utility Functions Over the Vertices of a Polytope
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
This page was built for publication: Fractional 0-1 programming and submodularity
