Fractional 0-1 programming and submodularity (Q2162513): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-022-01131-5 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210457748 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.07235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for assortment optimization under the nested logit model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set covering problem with linear fractional functional / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Class of Utility Functions Over the Vertices of a Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity in Conic Quadratic Mixed 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum capture problem with random utilities: problem formulation and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional 0-1 programming: applications and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity and local search approaches for maximum capture problems under generalized extreme value models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the facility location problem with submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of a class of nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving Fractional (0, 1) Programs By Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean query optimization and the 0-1 hyperbolic sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new saling algorithm for the maximum mean cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On upper bounds for assortment optimization under the mixture of multinomial logit models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Approximations for Assortment Planning with Product Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the facility location problems with linear/submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for competitive facility location with discrete attractiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the latent-class logit assortment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Market Segmentation, Cannibalization, and the Timing of Product Introductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for capacitated sum-of-ratios optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum ratio clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under a General Discrete Choice Model of Consumer Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of 0-1 hyperbolic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for solving the minimum multiple ratio spanning tree problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-022-01131-5 / rank
 
Normal rank

Latest revision as of 07:40, 17 December 2024

scientific article
Language Label Description Also known as
English
Fractional 0-1 programming and submodularity
scientific article

    Statements

    Fractional 0-1 programming and submodularity (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2022
    0 references
    fractional 0-1 programming
    0 references
    hyperbolic 0-1 programming
    0 references
    multiple ratios
    0 references
    single ratio
    0 references
    submodularity
    0 references
    assortment optimization
    0 references
    facility location
    0 references
    greedy algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers