Pages that link to "Item:Q1092794"

The following pages link to A quadratic integer program for the location of interacting hub facilities (Q1092794):

Displaying 50 items.

• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• Theoretical evidence of existing pitfalls in measuring hubbing practices in airline networks (Q1024049) (← links)
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
• A linear program for the two-hub location problem (Q1278146) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• On tabu search for the location of interacting hub facilities (Q1328642) (← links)
• Application of facility location modeling constructs to vendor selection problems (Q1333485) (← links)
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← links)
• Optimal use of hub facilities: A two-hub model with fixed arc costs (Q1367882) (← links)
• The hub location and routing problem (Q1388939) (← links)
• Location models for airline hubs behaving as \(M/D/c\) queues. (Q1423443) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• On the single-assignment \(p\)-hub center problem (Q1582051) (← links)
• Application of grey theory and multiobjective programming towards airline network design (Q1590798) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• Network cost minimization using threshold-based discounting (Q1600844) (← links)
• A hybrid heuristic for the uncapacitated hub location problem (Q1609911) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• The planar multifacility collection depots location problem (Q1628125) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
• The \(q\)-ad hoc hub location problem for multi-modal networks (Q1642959) (← links)
• A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem (Q1651637) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
• An improved algorithm for fixed-hub single allocation problems (Q1697895) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem (Q1717930) (← links)
• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)