Pages that link to "Item:Q3885553"

The following pages link to Bounds for aggregating nodes in network problems (Q3885553):

Displaying 12 items.

• Assessing the demand vulnerability of equilibrium traffic networks via network aggregation (Q291721) (← links)
• Using error bounds to compare aggregated generalized transportation models (Q863575) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Strategic planning in forest industries (Q1069855) (← links)
• The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
• A simulation study of some simplification strategies in the development of product-mix models (Q1170110) (← links)
• A procedure for optimizing tactical response in oil spill clean up operations (Q1290711) (← links)
• Integrated facility location and production scheduling in multi-generation energy systems (Q2417072) (← links)
• A note on node aggregation and Benders' decomposition (Q3316926) (← links)
• An improved disaggregation method for transportation problems (Q3662998) (← links)
• Error bounds for the aggregated convex programming problem (Q3664837) (← links)
• Integrated Ad Delivery Planning for Targeted Display Advertising (Q5031631) (← links)