Pages that link to "Item:Q2336590"

The following pages link to Fair optimization and networks: a survey (Q2336590):

Displaying 33 items.

• Inequity averse optimization in operational research (Q319581) (← links)
• Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system (Q786093) (← links)
• Analysis of two-layer resource supply flow networks (Q786169) (← links)
• Rappel: exploiting interest and network locality to improve fairness in publish-subscribe systems (Q838496) (← links)
• A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
• Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
• The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
• Piecewise equitable efficiency in multiobjective programming (Q1785299) (← links)
• Semi-fair design of emergency service system with failing centers (Q1788937) (← links)
• Inequity-averse stochastic decision processes (Q2028863) (← links)
• Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability (Q2134320) (← links)
• Heterogeneous flow distribution at the peak load in the multiuser network (Q2171298) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• Fair resource allocation: using welfare-based dominance constraints (Q2242256) (← links)
• A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
• An approach to the analysis of possible structural damages in multicommodity network systems (Q2284269) (← links)
• An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
• A fairness relation based on the asymmetric Choquet integral and its application in network resource allocation problems (Q2336672) (← links)
• Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (Q2455638) (← links)
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
• Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network (Q2695089) (← links)
• Estimate of resource distribution with the shortest paths in the multiuser network (Q2695135) (← links)
• Generalisation of <i>A</i>-equitable preference in multiobjective optimisation problems (Q5162588) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• Conditional value‐at‐risk beyond finance: a survey (Q6090467) (← links)
• A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
• Fairness in maximal covering location problems (Q6106589) (← links)
• A guide to formulating fairness in an optimization model (Q6110119) (← links)
• Fairness over time in dynamic resource allocation with an application in healthcare (Q6120930) (← links)
• Quantitative analysis of flow distributions in a multiuser telecommunication network (Q6178133) (← links)
• Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)
• Analysis of nodal multiflows in a multiuser system with equalizing control strategies (Q6546380) (← links)