Pages that link to "Item:Q2289952"

The following pages link to Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952):

Displaying 9 items.

• The \(p\)-hub center allocation problem (Q852943) (← links)
• An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
• A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war (Q2149602) (← links)
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (Q2253409) (← links)
• On the \(p\)-hub interdiction problem (Q2664408) (← links)
• Planning and design of intermodal hub networks: a literature review (Q2669565) (← links)
• A leader-follower single allocation hub location problem under fixed markups (Q5866184) (← links)