A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximin share and minimax envy in fair-division problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groves sealed bid auctions of heterogeneous objects with fair prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding an envy-free Pareto-optimal division / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for super envy-free cake division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proof assignment with fair compensation / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-envy in queueing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive envy-free division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity Maximizing Facility Location Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for several network location problems with equality measures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity measurement in facility location analysis: A review and framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sum Of Absolute Differences On A Network: Algorithm And Comparison With Other Equality Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcomes of voting and planning in single facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible model and efficient solution strategies for discrete location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the \(k\) largest functions in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for the obnoxious \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened formulation for the simple plant location problem with order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank

Latest revision as of 02:10, 29 June 2024

scientific article
Language Label Description Also known as
English
A comparison of formulations and solution methods for the minimum-envy location problem
scientific article

    Statements

    A comparison of formulations and solution methods for the minimum-envy location problem (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2009
    0 references
    0 references
    discrete location
    0 references
    equity
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references