Valid inequalities and branch-and-cut for the clique pricing problem (Q665989): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090914983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum utility product pricing models and algorithms based on reservation price / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tariff Optimization in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the network pricing problem with connected toll arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal product design using conjoint analysis: Computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for Stackelberg network pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Design and Pricing on a Network / rank
 
Normal rank

Latest revision as of 00:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Valid inequalities and branch-and-cut for the clique pricing problem
scientific article

    Statements

    Valid inequalities and branch-and-cut for the clique pricing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network pricing
    0 references
    mixed integer programming
    0 references
    combinatorial optimization
    0 references
    clique
    0 references
    0 references