Pages that link to "Item:Q689226"

The following pages link to Improving the location of minisum facilities through network modification (Q689226):

Displaying 31 items.

• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• Design of a location and transportation optimization model including quality of service using constrained multinomial logit (Q822058) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• The inverse 1-maxian problem with edge length modification (Q941835) (← links)
• Reverse 2-median problem on trees (Q943832) (← links)
• The inverse 1-median problem on a cycle (Q951097) (← links)
• The inverse Fermat-Weber problem (Q976390) (← links)
• Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
• A further study on inverse linear programming problems (Q1298792) (← links)
• Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
• Some reverse location problems (Q1576337) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
• A combined facility location and network design problem with multi-type of capacitated links (Q1788754) (← links)
• Improving spanning trees by upgrading nodes (Q1960523) (← links)
• Inverse median problems (Q2386211) (← links)
• On the optimum capacity of capacity expansion problems (Q2472185) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• Reverse 1-center problem on weighted trees (Q2790878) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• Improving spanning trees by upgrading nodes (Q4571960) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
• Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
• Upgrading bottleneck constrained forests (Q5928872) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study (Q6135637) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
• The reverse selective balance center location problem on trees (Q6191728) (← links)
• Modifying networks to obtain low cost trees (Q6550552) (← links)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)