A strengthened formulation for the simple plant location problem with order (Q2643785): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: COBRA: A new formulation of the classic \(p\)-median location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Location on a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closest assignment constraints and location models: Properties and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and peg algorithms for the simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on duality gap in the simple plant location problem / rank
 
Normal rank

Latest revision as of 13:18, 26 June 2024

scientific article
Language Label Description Also known as
English
A strengthened formulation for the simple plant location problem with order
scientific article

    Statements

    Identifiers