Pages that link to "Item:Q4242779"

The following pages link to Multicriteria network location problems with sum objectives (Q4242779):

Displaying 16 items.

• Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
• A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
• A note on the minmax regret centdian location on trees (Q935247) (← links)
• Geometric methods to solve max-ordering location problems (Q1289016) (← links)
• Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• Hub-and-spoke network design with congestion (Q1764770) (← links)
• Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
• Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
• Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
• The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
• An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
• Multicriteria planar ordered median problems (Q2583208) (← links)
• Effectiveness-equity models for facility location problems on tree networks (Q2811312) (← links)
• (Q4526867) (← links)
• (Q4944234) (← links)